36 search results - page 4 / 8 » Experiments on String Matching in Memory Structures |
125
click to vote
PAMI
2002
15 years 3 months ago
2002
This paper describes a handwritten character string recognition system for Japanese mail address reading on very large vocabulary. The address phrases are recognized as a whole bec...
142
click to vote
ICDE
2010
IEEE
16 years 3 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 ...
143
click to vote
VLDB
1993
ACM
15 years 8 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
164
click to vote
SIGSOFT
2007
ACM
16 years 4 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, ...
197
click to vote
DCC
2011
IEEE
14 years 10 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...