701 search results - page 2 / 141 » Kolmogorov complexity in perspective |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Merkle et al. [13] showed that all Kolmogorov-Loveland stochas
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...