1728 search results - page 130 / 346 » The Accelerated Euclidean Algorithm |
111
click to vote
SODA
2010
ACM
16 years 14 days ago
2010
ACM
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
106
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
130
click to vote
WACV
2005
IEEE
15 years 8 months ago
2005
IEEE
We describe a system that detects independently moving objects from a mobile platform in real time using a calibrated stereo camera. Interest points are first detected and tracke...
126
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
101
click to vote
FOCS
1997
IEEE
15 years 7 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...