Sciweavers

325 search results - page 18 / 65
» An architecture and algorithms for multi-run clustering
Sort
View
PC
2006
153views Management» more  PC 2006»
14 years 11 months ago
Algorithmic skeletons meeting grids
In this work, we discuss an extension of the set of principles that should guide the future design and development of skeletal programming systems, as defined by Cole in his ``pra...
Marco Danelutto, Marco Aldinucci
IPPS
2008
IEEE
15 years 6 months ago
Towards a decentralized architecture for optimization
We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clus...
Marco Biazzini, Mauro Brunato, Alberto Montresor
EUROPAR
2004
Springer
15 years 3 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
MOBIHOC
2002
ACM
15 years 11 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
DAC
1999
ACM
16 years 21 days ago
Simultaneous Circuit Partitioning/Clustering with Retiming for Performance Optimization
Partitioning and clustering are crucial steps in circuit layout for handling large scale designs enabled by the deep submicron technologies. Retiming is an important sequential lo...
Jason Cong, Honching Li, Chang Wu