3016 search results - page 144 / 604 » The Online Transportation Problem |
130
click to vote
NIPS
2008
15 years 5 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
142
click to vote
MICCAI
2004
Springer
16 years 5 months ago
2004
Springer
We tackle the problem of real-time statistical analysis of functional magnetic resonance imaging (fMRI) data. In a recent paper, we proposed an incremental algorithm based on the e...
125
click to vote
CCCG
1993
15 years 5 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
173
click to vote
ESA
2011
Springer
14 years 3 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
176
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we address the problem of learning an
adaptive appearance model for object tracking. In particular,
a class of tracking techniques called “tracking by detection...