34 search results - page 5 / 7 » Approximate String Matching with Reduced Alphabet |
143
click to vote
CIKM
2001
Springer
15 years 9 months ago
2001
Springer
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
204
click to vote
PAMI
2012
13 years 7 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...
145
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
105
click to vote
ICDAR
1999
IEEE
15 years 9 months ago
1999
IEEE
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
133
click to vote
SIGIR
1998
ACM
15 years 9 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....