74 search results - page 7 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
145
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
124
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
171
click to vote
PAMI
2012
13 years 4 months ago
2012
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
107
click to vote
SIGIR
1998
ACM
15 years 6 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
154
click to vote
STRINGOLOGY
2004
15 years 3 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...