Results 1  10
of
423,681
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
BitOptimal LempelZiv compression
, 2008
"... One of the most famous and investigated lossless datacompression scheme is the one introduced by Lempel and Ziv about 40 years ago [23]. This compression scheme is known as ”dictionarybased compression” and consists of squeezing an input string by replacing some of its substrings with (shorter) ..."
Abstract
 Add to MetaCart
on its generating source. In this paper we provide the first LZbased compressor which computes the bitoptimal parsing of any input string in efficient time and optimal space, for a general class of variablelength codeword encodings which encompasses most of the ones typically used in data compression
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 Compressed FullText SelfIndexes
, 2009
"... Because of the many growing text collections available from different sources, the fulltext search problem arises in a wealth of applications, which need to provide efficient access to large text collections. Classical text indexes require much space (besides storing the text itself), and thus migh ..."
Abstract
 Add to MetaCart
of their efficiency. In this thesis we carry out a deep study of compressed fulltext selfindexes based on LempelZiv compression (LZindexes for short), contributing with new developments in this area. We base our study on Navarro’s LZindex (or simply LZindex). Before our work, the LZindexes were an attractive
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
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
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
LempelZiv compression ratio. This fact is used todescribe results on LempelZiv compression in terms of dimension of complexity classes and vice versa. 1 Introduction Lutz [9] developed effective dimension (a Hausdorff like dimension) to quantitatively analyze the structure of complexity classes. Later
Tutorial on LempelZiv Data Compression Algorithm
"... In many scenario of digital communication and data processing, we may deal with strings of data which have certain structural regularities, making it possible for timesaving techniques of data compression. Given a discrete data source, the data compression problem is first to identify the limitatio ..."
Abstract
 Add to MetaCart
In many scenario of digital communication and data processing, we may deal with strings of data which have certain structural regularities, making it possible for timesaving techniques of data compression. Given a discrete data source, the data compression problem is first to identify
Stronger LempelZiv Based Compressed Text Indexing
, 2008
"... Given a text T[1..u] over an alphabet of size σ, the fulltext search problem consists in finding the occ occurrences of a given pattern P[1..m] in T. In indexed text searching we build an index on T to improve the search time, yet increasing the space requirement. The current trend in indexed text ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
) worstcase time. Despite this index has shown to be very competitive in practice, the O(m 3 log σ) term can be excessive for long patterns. Also, the factor 4 in its space complexity makes it larger than other stateoftheart alternatives. In this paper we present stronger LempelZiv based indices
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
Results 1  10
of
423,681