569 search results - page 36 / 114 » Online Bounds for Bayesian Algorithms |
ACCV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. ...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
−−−− The simultaneous localization and mapping (SLAM) with detection and tracking of moving objects (DATMO) problem is not only to solve the SLAM problem in dynamic environ...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...