Results 1  10
of
215,582
LempelZiv Dimensionfor LempelZiv Compression
"... Abstract This paper describes the LempelZiv dimension (Hausdorff like dimension inspired in the LZ78 parsing), its fundamental properties and relation with Hausdorff dimension. It is shown that in the case ofindividual infinite sequences, the LempelZiv dimension matches with the asymptotical Lemp ..."
Abstract
 Add to MetaCart
Abstract This paper describes the LempelZiv dimension (Hausdorff like dimension inspired in the LZ78 parsing), its fundamental properties and relation with Hausdorff dimension. It is shown that in the case ofindividual infinite sequences, the LempelZiv dimension matches with the asymptotical
Practical Parallel LempelZiv Factorization
"... In the age of big data, the need for efficient data compression algorithms has grown. A widely used data compression method is the LempelZiv77 (LZ77) method, being a subroutine in popular compression packages such as gzip and PKZIP. There has been a lot of recent effort on developing practical se ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
sequential algorithms for LempelZiv factorization (equivalent to LZ77 compression), but research in practical parallel implementations has been less satisfactory. In this work, we present a simple workefficient parallel algorithm for LempelZiv factorization. We show theoretically that our algorithm
Computing LempelZiv factorization online
 In: Proc. MFCS
, 2012
"... Abstract. We present an algorithm which computes the LempelZiv factorization of a word W of length n online in the following sense: it reads W starting from the left, and, after reading each r = O(logn) characters of W, updates the LempelZiv factorization. The algorithm requires O(n) bits of space ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We present an algorithm which computes the LempelZiv factorization of a word W of length n online in the following sense: it reads W starting from the left, and, after reading each r = O(logn) characters of W, updates the LempelZiv factorization. The algorithm requires O(n) bits
TITLE: Optimizing LempelZiv Factorization for
, 2014
"... iii Optimizing LempelZiv Factorization for the GPU Architecture Bryan Ching Lossless data compression is used to reduce storage requirements, allowing for the relief of I/O channels and better utilization of bandwidth. The LempelZiv lossless compression algorithms form the basis for many of the m ..."
Abstract
 Add to MetaCart
iii Optimizing LempelZiv Factorization for the GPU Architecture Bryan Ching Lossless data compression is used to reduce storage requirements, allowing for the relief of I/O channels and better utilization of bandwidth. The LempelZiv lossless compression algorithms form the basis for many
LempelZiv Index for qGrams
, 1998
"... . We present a new sublinearsize index structure for finding all occurrences of a given qgram in a text. Such a qgram index is needed in many approximate pattern matching algorithms. All earlier qgram indexes require at least O(n) space, where n is the length of the text. The new LempelZiv in ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
. We present a new sublinearsize index structure for finding all occurrences of a given qgram in a text. Such a qgram index is needed in many approximate pattern matching algorithms. All earlier qgram indexes require at least O(n) space, where n is the length of the text. The new LempelZiv
On the bitcomplexity of LempelZiv compression
"... One of the most famous and investigated lossless datacompression schemes is the one introduced by Lempel and Ziv about 30 years ago [37]. This compression scheme is known as “dictionarybased compressor ” and consists of squeezing an input string by replacing some of its substrings with (shorter) c ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
One of the most famous and investigated lossless datacompression schemes is the one introduced by Lempel and Ziv about 30 years ago [37]. This compression scheme is known as “dictionarybased compressor ” and consists of squeezing an input string by replacing some of its substrings with (shorter
Generalized LempelZiv Compression for Audio
 IEEE 6 TH WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING
, 2004
"... We introduce a novel compression paradigm to generalize a class of LempelZiv algorithms for lossy compression of multimedia. Based upon the fact that music, in particular electronically generated sound, has substantial level of repetitiveness within a single clip, we generalize the basic LempelZiv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce a novel compression paradigm to generalize a class of LempelZiv algorithms for lossy compression of multimedia. Based upon the fact that music, in particular electronically generated sound, has substantial level of repetitiveness within a single clip, we generalize the basic LempelZiv
Generalized LempelZiv Compression for Audio
"... Abstract — We introduce a novel compression paradigm to generalize a class of LempelZiv algorithms for lossy compression of multimedia. Based upon the fact that music, in particular electronically generated sound, has substantial level of repetitiveness within a single clip, we generalize the basic ..."
Abstract
 Add to MetaCart
Abstract — We introduce a novel compression paradigm to generalize a class of LempelZiv algorithms for lossy compression of multimedia. Based upon the fact that music, in particular electronically generated sound, has substantial level of repetitiveness within a single clip, we generalize
LempelZiv Compression of Structured Text
 In IEEE Data Compression Conference
, 2004
"... We describe a novel LempelZiv approach suitable for compressing structured documents, called LZCS, which takes advantage of redundant information that can appear in the structure. The main idea is that frequently repeated subtrees may exist and these can be replaced by a backward reference to th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We describe a novel LempelZiv approach suitable for compressing structured documents, called LZCS, which takes advantage of redundant information that can appear in the structure. The main idea is that frequently repeated subtrees may exist and these can be replaced by a backward reference
Smaller and Faster LempelZiv Indices
, 2007
"... Given a text T[1..u] over an alphabet of size σ = O(polylog(u)) and with kth order empirical entropy Hk(T), we propose a new compressed fulltext selfindex based on the LempelZiv (LZ) compression algorithm, which replaces T with a representation requiring about three times the size of the compres ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Given a text T[1..u] over an alphabet of size σ = O(polylog(u)) and with kth order empirical entropy Hk(T), we propose a new compressed fulltext selfindex based on the LempelZiv (LZ) compression algorithm, which replaces T with a representation requiring about three times the size
Results 1  10
of
215,582