447 search results - page 60 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
142
Voted
COMPGEOM
2009
ACM
15 years 10 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...
116
Voted
ICML
2006
IEEE
16 years 4 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...
122
Voted
DGCI
2005
Springer
15 years 9 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...
125
Voted
COMPGEOM
1998
ACM
15 years 7 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...
136
Voted
SODA
2003
ACM
15 years 5 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...