7228 search results - page 180 / 1446 » From Algorithmic to Subjective Randomness |
183
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
115
click to vote
CIE
2010
Springer
15 years 7 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
136
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
196
Voted
CATA
2009
15 years 4 months ago
2009
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...
128
Voted
CIE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...