701 search results - page 14 / 141 » Kolmogorov complexity in perspective |
FUIN
2008
13 years 7 months ago
2008
A few years ago a nice criterion of Martin-L
STACS
2005
Springer
14 years 1 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
CSR
2011
Springer
12 years 11 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...
ICCV
2009
IEEE
15 years 16 days ago
2009
IEEE
In recent years the Markov Random Field (MRF) has
become the de facto probabilistic model for low-level vision
applications. However, in a maximum a posteriori
(MAP) framework, ...