Share This Author
Order Preserving Matching
Property matching and weighted matching
Music Genre Classification via Compressive Sampling
A CS-based classifier for music genre classification, with two sets of features, including short-time and long-time features of audio music, that generates a compact signature to achieve a significant reduction in the dimensionality of the audio music signals.
Symposium on Theoretical Aspects of Computer Science
Approximate String Matching with Gaps
- M. Crochemore, C. Iliopoulos, C. Makris, W. Rytter, A. Tsakalidis, T. Tsichlas
- Computer ScienceNordic Journal of Computing
- 1 March 2002
This paper considers several new versions of approximate string matching with gaps, the main characteristic of which is the existence of gaps in the matching of a given pattern in a text.
Optimal Superprimitivity Testing for Strings
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
- C. Iliopoulos
- Computer ScienceSIAM journal on computing (Print)
- 1 August 1989
The upper bounds derived on the computational complexity of the algorithms above improve the upper bounds given by Kannan and Bachem in [SIAM J. Comput., 8 (1979), pp. 499–507].
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem
Algorithms for computing variants of the longest common subsequence problem