17 search results - page 3 / 4 » Prototype Selection for Finding Efficient Representations of... |
PAMI
2006
13 years 7 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
CG
2008
Springer
13 years 7 months ago
2008
Springer
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a ne...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...