1082 search results - page 145 / 217 » Approximation Algorithms for Spreading Points |
MDM
2009
Springer
14 years 3 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
COMPGEOM
1998
ACM
14 years 1 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
SMA
2008
ACM
13 years 9 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
CVPR
2003
IEEE
14 years 11 months ago
2003
IEEE
12 In this paper we study the problem of shape analysis and its application in locating facial feature points on frontal faces. We propose a Bayesian inference solution based on ta...