318 search results - page 21 / 64 » A New Indexing Method for Approximate String Matching |
169
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
IJFCS
2006
14 years 9 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
SEMWEB
2005
Springer
15 years 3 months ago
2005
Springer
Ontologies are today a key part of every knowledge based system. They provide a source of shared and precisely defined terms, resulting in system interoperability by knowledge sha...
AIRS
2004
Springer
15 years 2 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
ICPR
2010
IEEE
15 years 24 days ago
2010
IEEE
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...