Sciweavers

648 search results - page 88 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
COLT
2004
Springer
14 years 2 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
ECCV
2002
Springer
14 years 10 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec
WSC
2004
13 years 10 months ago
Optimal Computing Budget Allocation for Multi-Objective Simulation Models
Simulation plays a vital role in identifying the best system design from among a set of competing designs. To improve simulation efficiency, ranking and selection techniques are o...
Loo Hay Lee, Ek Peng Chew, Suyan Teng, David Golds...
RAS
2008
139views more  RAS 2008»
13 years 8 months ago
Unsupervised identification of useful visual landmarks using multiple segmentations and top-down feedback
In this paper, we tackle the problem of unsupervised selection and posterior recognition of visual landmarks in images sequences acquired by an indoor mobile robot. This is a high...
Pablo Espinace, Daniel Langdon, Alvaro Soto
AI
2002
Springer
13 years 8 months ago
Ensembling neural networks: Many could be better than all
Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its compone...
Zhi-Hua Zhou, Jianxin Wu, Wei Tang