108 search results - page 4 / 22 » Fast Convolutions and Their Applications in Approximate Stri... |
DASFAA
2009
IEEE
14 years 1 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
CIKM
1997
Springer
13 years 10 months ago
1997
Springer
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
ICALP
2005
Springer
13 years 11 months 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...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...