24 search results - page 1 / 5 » On Pseudoentropy versus Compressibility |
COCO
2004
Springer
13 years 10 months ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
SIGGRAPH
1995
ACM
13 years 8 months ago
1995
ACM
Recent advances in realtime image compression and decompression hardware make it possible for a high-performance graphics engine to operate as a rendering server in a networked en...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
EMNLP
2009
13 years 2 months ago
2009
This work introduces a model free approach to sentence compression, which grew out of ideas from Nomoto (2008), and examines how it compares to a state-of-art model intensive appr...