324 search results - page 61 / 65 » Distance Approximating Trees: Complexity and Algorithms |
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
FGR
2011
IEEE
12 years 10 months ago
2011
IEEE
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...