7150 search results - page 78 / 1430 » An Approximation Algorithm for Approximation Rank |
89
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
104
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
106
click to vote
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
139
click to vote
COMGEO
2004
ACM
15 years 13 days ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
93
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...