263 search results - page 8 / 53 » Efficient Variants of the ICP Algorithm |
DAGSTUHL
2004
14 years 11 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
101
click to vote
PAMI
2007
14 years 9 months ago
2007
—We present a fully automatic face recognition algorithm and demonstrate its performance on the FRGC v2.0 data. Our algorithm is multimodal (2D and 3D) and performs hybrid (featu...
TOG
2002
14 years 9 months ago
2002
The digitization of the 3D shape of real objects is a rapidly expanding field, with applications in entertainment, design, and archaeology. We propose a new 3D model acquisition s...
159
click to vote
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...