84 search results - page 13 / 17 » Finding the Nearest Neighbors in Biological Databases Using ... |
ISCI
2007
13 years 7 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
W2GIS
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
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...
NIPS
2004
13 years 9 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...