Sciweavers

1285 search results - page 43 / 257
» On the Complexity of Ordinal Clustering
Sort
View
PDP
2003
IEEE
14 years 2 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
13 years 6 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
KAIS
2006
110views more  KAIS 2006»
13 years 8 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
ADC
2005
Springer
106views Database» more  ADC 2005»
14 years 2 months ago
OS Support for a Commodity Database on PC clusters - Distributed Devices vs. Distributed File Systems
In this paper we attempt to parallelise a commodity database for OLAP on a cluster of commodity PCs by using a distributed high-performance storage subsystem. By parallelising the...
Felix Rauch, Thomas Stricker
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini