1100 search results - page 47 / 220 » Approximate distance oracles |
187
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
114
click to vote
MIAR
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
IJAR
2010
14 years 8 months ago
2010
The present article considers estimating a parameter θ in an imprecise probability model (Pθ)θ∈Θ which consists of coherent upper previsions Pθ . After the definition of a...
IJRR
2007
14 years 9 months ago
2007
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
IWCIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Several authors have proposed algorithms for curve partitioning using the arc-chord distance formulation, where a chord whose associated arc spans k pixels is moved along...