Sciweavers

108 search results - page 16 / 22
» Cover Trees for Nearest Neighbor
Sort
View
COMPGEOM
2010
ACM
14 years 29 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
3DIM
2007
IEEE
14 years 2 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
IJCNN
2000
IEEE
14 years 8 days ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 9 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
ESEM
2007
ACM
13 years 9 months ago
Mining Software Evolution to Predict Refactoring
Can we predict locations of future refactoring based on the development history? In an empirical study of open source projects we found that attributes of software evolution data ...
Jacek Ratzinger, Thomas Sigmund, Peter Vorburger, ...