336 search results - page 11 / 68 » Compression of Samplable Sources |
121
Voted
DCC
1992
IEEE
15 years 3 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...
88
Voted
NAACL
2010
14 years 9 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...
DCC
2003
IEEE
15 years 11 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...
DCC
1999
IEEE
15 years 4 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...
CORR
2006
Springer
14 years 11 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...