3875 search results - page 162 / 775 » Approximation algorithms for the 0-extension problem |
170
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
135
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
147
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
140
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
145
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...