78 search results - page 4 / 16 » Compressed Index for Dictionary Matching |
SPIRE
1998
Springer
13 years 11 months ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
CPM
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
ALGORITHMICA
2010
13 years 7 months ago
2010
ICIP
2004
IEEE
2004
IEEE
Improved dictionaries for generalized bitplanes-based matching pursuits video coding using ridgelets
14 years 9 months ago
A novel decomposition of functions using generalized bitplanes has been recently proposed. Such a decomposition maps a function into a set of indexes, thus performing quantization...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...