Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

COCO
2004
Springer

favoriteEmaildiscussreport

79views Algorithms» more COCO 2004»

On Pseudoentropy versus Compressibility

13 years 9 months ago

On Pseudoentropy versus Compressibility

Download www1.cs.columbia.edu

A source is compressible if we can eﬃciently compute short descriptions of strings in the support and eﬃciently recover the strings from the descriptions. A source has high pseudo-entropy if it is computationally distinguishable from a source of high entropy. In this paper, we present a technique for proving lower bounds on compressibility in an oracle setting, which yields the following results:

Hoeteck Wee

Real-time Traffic

COCO 2004 | Compressible | Lower Bounds | Short Descriptions |

claim paper

Related Content

» Conditional Computational Entropy or Toward Separating Pseudoentropy from Compressibility

» Polygonassisted JPEG and MPEG compression of synthetic images

» Shannon Information and Kolmogorov Complexity

» A Comparison of Model Free versus Model Intensive Approaches to Sentence Compression

» Effect of Surface Expansion and Compression on the Surface Tension of 1octanol Solutions

» Compression of 3D triangular meshes with progressive precision

» Optimal PET Protection for Streaming Scalably Compressed Video Streams With Limited Retran...

» Code Optimization for Code Compression

» JPEG compression history estimation for color images

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	COCO
Authors	Hoeteck Wee

Comments (0)