154 search results - page 21 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
DCC
1998
IEEE
15 years 3 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
ICML
2010
IEEE
15 years 22 days ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
227
click to vote
VLDB
2002
ACM
15 years 12 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
102
Voted
CPM
2001
Springer
15 years 4 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
SPIRE
1998
Springer
15 years 3 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...