2252 search results - page 317 / 451 » Improving Random Forests |
72
Voted
MICCAI
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we propose a unified framework for computing atlases from manually labeled data at various degrees of "sharpness" and the joint registration-segmentation o...
85
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
118
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
97
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
116
Voted
ICML
2001
IEEE
16 years 1 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...