Sciweavers

927 search results - page 68 / 186
» Stability of k -Means Clustering
Sort
View
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
13 years 9 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, ...
IPPS
2006
IEEE
14 years 2 months ago
Lossless compression for large scale cluster logs
The growing computational and storage needs of several scientific applications mandate the deployment of extreme-scale parallel machines, such as IBM’s Blue Gene/L which can acc...
R. Balakrishnan, Ramendra K. Sahoo
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 9 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
DATAMINE
2006
89views more  DATAMINE 2006»
13 years 8 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
CDC
2008
IEEE
127views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed control: A sequentially semi-separable approach
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
Justin K. Rice, Michel Verhaegen