180 search results - page 10 / 36 » Approximate Searching on Compressed Text |
99
Voted
ICPPW
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper presents an analytical performance prediction model that can be used to predict the speedup and similar performance metrics of four approximate string searching implemen...
126
Voted
SIGIR
2011
ACM
14 years 3 months ago
2011
ACM
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
103
Voted
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
125
click to vote
ALGORITHMICA
2000
15 years 12 days ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
103
Voted
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this work we describe a sequence compression method based on combining a Bayesian nonparametric sequence model with entropy encoding. The model, a hierarchy of Pitman-Yor proce...