2434 search results - page 205 / 487 » Algorithmic Randomness of Closed Sets |
130
click to vote
NIPS
2007
15 years 5 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
137
Voted
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
121
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
142
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
146
click to vote
ACTA
2000
15 years 4 months ago
2000
Thesaurus is a collection of words classified according to some relatedness measures among them. In this paper, we lay the theoretical foundations of thesaurus construction through...