835 search results - page 103 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
We present an approach for online learning of discriminative appearance models for robust multi-target tracking in a crowded scene from a single camera. Although much progress has...
WADS
2009
Springer
14 years 5 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
NIPS
2007
14 years 6 days ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In various applications, the effect of errors in gradient-based iterations is of particular importance when seeking saddle points of the Lagrangian function associated with constra...
JCT
2011
13 years 5 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...