336 search results - page 1 / 68 » Compression of Samplable Sources |
COCO
2004
Springer
13 years 9 months ago
2004
Springer
We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources ...
ECCC
2011
13 years 12 days ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
DCC
2010
IEEE
14 years 9 days ago
2010
IEEE
It is known that modeling an information source via a symbolic dynamical system evolving over the unit interval, leads to a natural lossless compression scheme attaining the entro...