31 search results - page 2 / 7 » A faster implementation of the Goemans-Williamson clustering... |
SIGKDD
2000
13 years 4 months ago
2000
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
ISPD
2005
ACM
13 years 10 months ago
2005
ACM
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
FPL
2006
Springer
13 years 8 months ago
2006
Springer
High-performance document clustering systems enable similar documents to automatically self-organize into groups. In the past, the large amount of computational time needed to clu...
PPOPP
1999
ACM
13 years 9 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
SIGIR
2009
ACM
13 years 11 months ago
2009
ACM
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...