Sciweavers

324 search results - page 4 / 65
» Distance Approximating Trees: Complexity and Algorithms
Sort
View
ACSC
2006
IEEE
14 years 1 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
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 (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—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...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
ACL
2004
13 years 8 months ago
Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
COMPGEOM
2000
ACM
13 years 11 months ago
When crossings count - approximating the minimum spanning tree
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...
Sariel Har-Peled, Piotr Indyk
TIP
1998
109views more  TIP 1998»
13 years 7 months ago
Optimum design of chamfer distance transforms
—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...
Muhammad Akmal Butt, Petros Maragos