12 search results - page 1 / 3 » Extracting the Kolmogorov Complexity of Strings and Sequence... |
STACS
2009
Springer
2009
Springer
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
13 years 11 months ago
CORR
2011
Springer
12 years 11 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 ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
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...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...
ESANN
2007
13 years 5 months ago
2007
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...