Sciweavers

701 search results - page 13 / 141
» Kolmogorov complexity in perspective
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 7 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
ICANN
2009
Springer
14 years 2 months ago
Modelling Image Complexity by Independent Component Analysis, with Application to Content-Based Image Retrieval
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...
Jukka Perkiö, Aapo Hyvärinen
COLT
2003
Springer
14 years 24 days ago
Sequence Prediction Based on Monotone Complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
Marcus Hutter
JCSS
2006
77views more  JCSS 2006»
13 years 7 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 2 months ago
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
Marius Zimand