2566 search results - page 79 / 514 » The Online Median Problem |
90
Voted
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
AIPS
2008
15 years 3 months ago
2008
Despite the recent resurgence of interest in learning methods for planning, most such efforts are still focused exclusively on classical planning problems. In this work, we invest...
105
Voted
JMLR
2010
14 years 11 months ago
2010
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
STACS
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
93
Voted
3DIM
1999
IEEE
15 years 5 months ago
1999
IEEE
In this paper, we address the problem of hand-eye calibration of a robot mounted video camera. In a rst time, we derive a new linear formulation of the problem. This allows an alg...