2600 search results - page 123 / 520 » Clustering with or without the Approximation |
165
click to vote
COMPGEOM
2006
ACM
16 years 12 days ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
173
click to vote
WCRE
2008
IEEE
16 years 24 days ago
2008
IEEE
During software maintenance tasks, developers often spend an important amount of effort investigating source code. This effort can be reduced if tools are available to help develo...
158
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
149
click to vote
CLUSTER
2008
IEEE
16 years 27 days ago
2008
IEEE
—The concept of green computing has attracted much attention recently in cluster computing. However, previous local approaches focused on saving the energy cost of the components...
168
click to vote
IPCCC
2006
IEEE
16 years 13 days ago
2006
IEEE
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...