154 search results - page 17 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
147
Voted
SPIRE
2000
Springer
15 years 7 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
146
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
137
Voted
SECON
2007
IEEE
15 years 10 months ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
114
Voted
ICAIL
2003
ACM
15 years 9 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
105
Voted
CHI
1993
ACM
15 years 7 months ago
1993
ACM
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...