396 search results - page 2 / 80 » Scalability for Clustering Algorithms Revisited |
COCOON
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
KDD
2001
ACM
14 years 5 months ago
2001
ACM
JASIS
2007
13 years 4 months ago
2007
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
CCGRID
2008
IEEE
13 years 6 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...