752 search results - page 87 / 151 » Faster approximation algorithms for the minimum latency prob... |
160
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
131
Voted
WSC
2008
15 years 5 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
131
Voted
ICCAD
2001
IEEE
16 years 7 days ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
128
click to vote
EMMCVPR
1999
Springer
15 years 7 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
148
click to vote
ESA
2007
Springer
15 years 9 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...