5153 search results - page 544 / 1031 » Introduction to Randomized Algorithms |
218
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
168
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results. Starting from random initial play, TD...
152
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
184
click to vote
JMLR
2010
15 years 5 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
163
click to vote
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Learning-based approaches have become increasingly practical in medical imaging. For a supervised learning strategy, the quality of the trained algorithm (usually a class...