1728 search results - page 116 / 346 » The Accelerated Euclidean Algorithm |
149
click to vote
PAMI
2006
15 years 2 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...
103
click to vote
MP
1998
15 years 2 months ago
1998
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
126
click to vote
ICPPW
2007
IEEE
15 years 9 months ago
2007
IEEE
Several challenges about computational grid exist in integrating, coordinating and managing of resources and scheduling of applications, due to distributed resources at various le...
145
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
120
click to vote
VISUALIZATION
1995
IEEE
15 years 6 months ago
1995
IEEE
We present an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm c...