Sciweavers

1190 search results - page 93 / 238
» On the Structure of Syntenic Distance
Sort
View
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 7 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 6 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
MICCAI
2010
Springer
15 years 4 months ago
Image Registration Driven by Combined Probabilistic and Geometric Descriptors
Abstract. Deformable image registration in the presence of considerable contrast differences and large-scale size and shape changes represents a significant challenge for image r...
Linh K. Ha, Marcel Prastawa, Guido Gerig, John H. ...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 8 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
CVPR
2004
IEEE
16 years 8 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...