447 search results - page 60 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
DGCI
2005
Springer
14 years 2 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
COMPGEOM
1998
ACM
14 years 22 days 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...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...