2566 search results - page 58 / 514 » The Online Median Problem |
FCT
2005
Springer
14 years 4 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
The aim of color constancy is to remove the effect of the
color of the light source. As color constancy is inherently
an ill-posed problem, most of the existing color constancy
...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
CP
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...