324 search results - page 4 / 65 » Distance Approximating Trees: Complexity and Algorithms |
ACSC
2006
IEEE
15 years 5 months ago
2006
IEEE
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
98
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
76
Voted
ACL
2004
15 years 1 months ago
2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
106
Voted
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
TIP
1998
14 years 11 months ago
1998
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...