Sciweavers

905 search results - page 45 / 181
» On the Complexity of uSPR Distance
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 8 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 2 months ago
Cooperative Vehicle Position Estimation
Abstract— We present a novel cooperative vehicle position estimation algorithm, which can achieve higher levels of accuracy and reliability than existing GPS based positioning so...
Ryan Parker, Shahrokh Valaee
ICDAR
2005
IEEE
14 years 2 months ago
Prototype Learning Methods for Online Handwriting Recognition
In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of th...
B. S. Raghavendra, C. K. Narayanan, G. Sita, A. G....
WDAG
2005
Springer
102views Algorithms» more  WDAG 2005»
14 years 2 months ago
Papillon: Greedy Routing in Rings
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
SEBD
1997
158views Database» more  SEBD 1997»
13 years 9 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...