34 search results - page 5 / 7 » Approximate K-D Tree Search for Efficient ICP |
NLP
2000
14 years 1 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
SIGMOD
2005
ACM
14 years 10 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 ...
JGTOOLS
2006
13 years 9 months ago
2006
We render tree foliage levels of detail (LODs) using a new adaptation of billboard clouds. Our contributions are a simple and efficient billboard cloud creation algorithm designed...
VLDB
2001
ACM
14 years 2 months ago
2001
ACM
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...