Sciweavers

599 search results - page 72 / 120
» Online learning by ellipsoid method
Sort
View
ICTAI
2010
IEEE
13 years 6 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
JMLR
2002
135views more  JMLR 2002»
13 years 8 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang
CVPR
2010
IEEE
14 years 4 months ago
Rapid Selection of Reliable Templates for Visual Tracking
We propose a method that rates the suitability of given templates for template-based tracking in real-time. This is important for applications with online template selection, such...
Nicolas Alt, Stefan Hinterstoisser, Nassir Navab
AAAI
2008
13 years 11 months ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen
ECCV
2010
Springer
13 years 9 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof