18 search results - page 4 / 4 » Improved Approximation Bounds for Planar Point Pattern Match... |
COMPGEOM
2009
ACM
13 years 11 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...
PROFES
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. System architectures are described in abstract terms, often using Design Patterns. Actual reuse based on such descriptions requires that each development project derive a...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...