37 search results - page 3 / 8 » Lempel-Ziv Dimension for Lempel-Ziv Compression |
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...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
CSL
2003
Springer
13 years 10 months ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...