Sciweavers

11910 search results - page 329 / 2382
» Online Learning Algorithms
Sort
View
COLT
2007
Springer
16 years 25 days ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
SPAA
2004
ACM
16 years 2 days ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...
CIAC
2010
Springer
275views Algorithms» more  CIAC 2010»
16 years 4 months ago
Online Cooperative Cost Sharing
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...
Janina Brenner and Guido Schaefer
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 6 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
16 years 1 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...