336 search results - page 11 / 68 » Compression of Samplable Sources |
134
Voted
DCC
1992
IEEE
15 years 6 months ago
1992
IEEE
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
103
Voted
NAACL
2010
14 years 11 months ago
2010
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
95
Voted
DCC
2003
IEEE
16 years 1 months ago
2003
IEEE
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
114
click to vote
DCC
1999
IEEE
15 years 6 months ago
1999
IEEE
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a loss...
94
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider a distributed source coding system in which several observations must be encoded separately and communicated to the decoder by using limited transmission rate. We intro...