1647 search results - page 114 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
139
Voted
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
156
Voted
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
148
click to vote
INFOVIS
2003
IEEE
15 years 10 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
119
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
166
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...