Sciweavers

Share
32 search results - page 1 / 7
» A faster implementation of the Goemans-Williamson clustering...
Sort
View
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
9 years 8 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
9 years 8 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
SSDBM
2010
IEEE
153views Database» more  SSDBM 2010»
10 years 6 days ago
Scalable Clustering Algorithm for N-Body Simulations in a Shared-Nothing Cluster
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
YongChul Kwon, Dylan Nunley, Jeffrey P. Gardner, M...
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
10 years 11 days ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...
SIGIR
2009
ACM
10 years 1 months ago
Dynamicity vs. effectiveness: studying online clustering for scatter/gather
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
Weimao Ke, Cassidy R. Sugimoto, Javed Mostafa
books