98 search results - page 5 / 20 » Kolmogorov Complexity in Randomness Extraction |
CCA
2009
Springer
14 years 4 days ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
EUROGP
2001
Springer
13 years 10 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
CSR
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
LREC
2008
13 years 7 months ago
2008
Traditional Authorship Attribution models extract normalized counts of lexical elements such as nouns, common words and punctuation and use these normalized counts or ratios as fe...
CAS
1999
13 years 5 months ago
1999
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...