1100 search results - page 72 / 220 » Approximate distance oracles |
CCCG
2007
14 years 11 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
CVPR
2001
IEEE
16 years 11 hour ago
2001
IEEE
This paper presents a new approach to ranking relevant images for retrieval. Distance in the feature space associated with a kernel is used to rank relevant images. An adaptive qu...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
3DIM
2003
IEEE
15 years 1 months ago
2003
IEEE
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...