2566 search results - page 42 / 514 » The Online Median Problem |
ALGORITHMICA
2010
13 years 10 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
COMPGEOM
2007
ACM
14 years 2 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
GREC
2003
Springer
14 years 3 months ago
2003
Springer
A brief survey on on-line graphics recognition is presented. We first present some common scenarios and applications of on-line graphics recognition and then identify major problem...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...