638 search results - page 3 / 128 » Applications of Approximate Word Matching in Information Ret... |
CPM
1998
Springer
13 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
SPIRE
1999
Springer
13 years 10 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
MM
2003
ACM
13 years 11 months ago
2003
ACM
Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these...
SOFSEM
2007
Springer
13 years 12 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer