45 search results - page 4 / 9 » A Scalable Parallel Subspace Clustering Algorithm for Massiv... |
PAMI
2011
13 years 3 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
TVCG
2012
11 years 11 months ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
DKE
2006
13 years 8 months ago
2006
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
IPPS
1996
IEEE
14 years 22 days ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...