486 search results - page 20 / 98 » Online update of b-trees |
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We treat tracking as a matching problem of detected keypoints between successive frames. The novelty of this paper is to learn classifier-based keypoint descriptions allowing to i...
291
click to vote
ICA
2012
Springer
13 years 5 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
COLING
1992
14 years 10 months ago
1992
A description is given of the present state of development of a workstation that has been designed to provide the translator with efficient and easy-to-use computational tools. Th...