15494 search results - page 108 / 3099 » Computing dynamic clusters |
110
Voted
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
131
Voted
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Multi-core processors with accelerators are becoming commodity components for high-performance computing at scale. While accelerator-based processors have been studied in...
121
Voted
GRID
2008
Springer
15 years 3 months ago
2008
Springer
As computer networks rapidly increase in size and speed, Internet-distributed systems such as P2P, volunteer computing, and Grid systems are increasingly common. A precise and acc...
111
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
A novel unsupervised clustering algorithm called Hyperclique Pattern-KMEANS (HP-KMEANS) is presented. Considering recent success in semisupervised clustering using pair-wise const...
105
Voted
JGTOOLS
2006
15 years 2 months ago
2006
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...