Results 1  10
of
154,719
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
Estimating the Entropy Rate of Spike Trains via LempelZiv Complexity
, 2004
"... Normalized LempelZiv complexity, which measures the generation rate of new patterns along a digital sequence, is closely related to such important source properties as entropy and compression ratio, but, in contrast to these, it is a property of individual sequences. In this article, we propose to ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Normalized LempelZiv complexity, which measures the generation rate of new patterns along a digital sequence, is closely related to such important source properties as entropy and compression ratio, but, in contrast to these, it is a property of individual sequences. In this article, we propose
On The Average Redundancy Rate Of The LempelZiv Code
 IEEE Trans. Inform. Theory
, 1996
"... In this paper, we settle a long standing open problem concerning the average redundancy, r n , of the LempelZiv'78 (LZ78) code. We prove that for a memoryless source the average redundancy rate attains asymptotically Er n = (A + ffi(n))= log n + O(log log n= log 2 n), where A is an explici ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
. The main result of this paper is a consequence of recently obtained secondorder properties of the LempelZiv algorithm [P. Jacquet, W. Szpankowski, Theoretical Computer Science, 144, 1995]. These findings have been established by analytical techniques of the precise analysis of algorithms. We give a brief
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
prominent approaches include indexes based on Compressed Suffix Arrays, on the BurrowsWheeler transform, and on LempelZiv compression. Though the attention of researchers has been biased towards suffixarraybased compressed indexes, other kinds of compressed selfindexes deserve to be considered, because
String Matching in LempelZiv Compressed Strings
, 1991
"... String matching and Compression are two widely studied areas of computer science. The theory of string matching has a long association with compression algorithms. Data structures from string matching can be used to derive fast implementations of many important compression schemes, most notably the ..."
Abstract
 Add to MetaCart
the LempelZiv (LZ1) algorithm. Intuitively, once a string has been compressed  and therefore its repetitive nature has been elucidated  one might be tempted to exploit this knowledge to speed up string matching. The Compressed Matching Problem is that of performing string matching in a compressed text
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
index needs only O(n/log n) space while being as fast as previous methods. The new method takes advantage of repetitions in the text found by LempelZiv parsing. Key Words. qGram index, Approximate pattern matching, Text indexing, LempelZiv parsing, String algorithms, Data compression. 1
Interpretation of the LempelZiv Complexity Measure in the Context of Biomedical Signal Analysis
 IEEE Transactions on Biomedical Engineering
"... Abstract—LempelZiv complexity (LZ) and derived LZ algorithms have been extensively used to solve information theoretic problems such as coding and lossless data compression. In recent years, LZ has been widely used in biomedical applications to estimate the complexity of discretetime signals. Desp ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
Abstract—LempelZiv complexity (LZ) and derived LZ algorithms have been extensively used to solve information theoretic problems such as coding and lossless data compression. In recent years, LZ has been widely used in biomedical applications to estimate the complexity of discretetime signals
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
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
Results 1  10
of
154,719