93 search results - page 16 / 19 » Fast Searching on Compressed Text Allowing Errors |
DAGSTUHL
2006
13 years 8 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
CIKM
2003
Springer
14 years 20 days ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
ICALP
2005
Springer
14 years 29 days ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
SOSP
2007
ACM
14 years 4 months ago
2007
ACM
As users interact with the world and their peers through their computers, it is becoming important to archive and later search the information that they have viewed. We present De...