Sciweavers

2694 search results - page 418 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 7 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
CVPR
2004
IEEE
15 years 10 months ago
Face Localization via Hierarchical CONDENSATION with Fisher Boosting Feature Selection
We formulate face localization as a Maximum A Posteriori Probability(MAP) problem of finding the best estimation of human face configuration in a given image. The a prior distribu...
Jilin Tu, ZhenQiu Zhang, Zhihong Zeng, Thomas S. H...
ICALP
2009
Springer
16 years 6 months ago
External Sampling
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
MICCAI
2002
Springer
16 years 7 months ago
Multi-modal Image Registration by Minimising Kullback-Leibler Distance
In this paper, we propose a multi-modal image registration method based on the a priori knowledge of the expected joint intensity distribution estimated from aligned training image...
Albert C. S. Chung, William M. Wells III, Alexande...