502 search results - page 49 / 101 » Sparse Subspace Clustering |
116
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
161
click to vote
DATAMINE
1999
15 years 1 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
122
click to vote
PARA
2004
Springer
15 years 7 months ago
2004
Springer
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...
120
click to vote
GIS
2008
ACM
15 years 3 months ago
2008
ACM
Bintrees based on longest edge bisection and hierarchies of diamonds are popular multiresolution techniques on regularly sampled terrain datasets. In this work, we consider sparse...
110
click to vote
ISCIS
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase...