29 search results - page 1 / 6 » A Parallel Algorithm for Incremental Compact Clustering |
EUROPAR
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
PLDI
2006
ACM
13 years 10 months ago
2006
ACM
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
ITNG
2010
IEEE
13 years 9 months ago
2010
IEEE
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
IDEAS
2006
IEEE
13 years 10 months ago
2006
IEEE
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...