449 search results - page 64 / 90 » Finding Structure in Reinforcement Learning |
151
click to vote
ICML
1994
IEEE
15 years 7 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
136
click to vote
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
137
Voted
MICCAI
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. In medical imaging, finding landmarks that provide biologically meaningful correspondences is often a challenging and time-consuming manual task. In this paper we propose...
128
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
116
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...