15 search results - page 1 / 3 » Pattern Matching in Huffman Encoded Texts |
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (D...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...