160 search results - page 17 / 32 » Approximate Computation of Object Distances by Locality-Sens... |
GIS
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
ISBI
2008
IEEE
14 years 8 months ago
2008
IEEE
We present a method to automatically quantify the local asymmetries of bilateral structures in point clouds. The method relies on the robust computation of the approximate symmetr...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...