Sciweavers

2566 search results - page 58 / 514
» The Online Median Problem
Sort
View
FCT
2005
Springer
14 years 4 months ago
The Maximum Resource Bin Packing Problem
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. ...
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens ...
ICCV
2009
IEEE
15 years 3 months ago
Color Constancy using 3D Scene Geometry
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 ...
Rui Lu, Arjan Gijsenij, Theo Gevers
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 11 months ago
Discovering bucket orders from full rankings
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...
Jianlin Feng, Qiong Fang, Wilfred Ng
CP
2001
Springer
14 years 3 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
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...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
COCOON
2007
Springer
14 years 2 months ago
An Improved Algorithm for Online Unit Clustering
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...
Hamid Zarrabi-Zadeh, Timothy M. Chan