Melodic matching techniques for large music databases
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Efficient Computation of All Longest Common Subsequences
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The constrained longest common subsequence problem
Information Processing Letters
Journal of the ACM (JACM)
Distributed Code and Data Propagation Algorithm for Longest Common Subsequence Problem Solving
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
A space efficient algorithm for the constrained heaviest common subsequence problem
Proceedings of the 46th Annual Southeast Regional Conference on XX
Constructing text sense representations
TextMean '04 Proceedings of the 2nd Workshop on Text Meaning and Interpretation
Comparing best-first search and dynamic programming for optimal multiple sequence alignment
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Reusable grid computing architecture based on code propagation method
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |