4843 search results - page 412 / 969 » The Shortcut Problem - Complexity and Approximation |
129
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
141
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— This paper proposes a new way to achieve robotic tasks by visual servoing. Instead of using geometric features (points, straight lines, pose, homography, etc.) as it is usually...
120
Voted
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
159
click to vote
ACSC
2005
IEEE
15 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
133
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...