93 search results - page 2 / 19 » Making k-means Even Faster |
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
SIAMCOMP
2008
14 years 11 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
123
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
ASPLOS
1996
ACM
15 years 3 months ago
1996
ACM
: One of the fundamental limits to high-performance, high-reliability file systems is memory's vulnerability to system crashes. Because memory is viewed as unsafe, systems per...