๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient agglomerative clustering algorithm using a heap

โœ Scribed by Takio Kurita

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
303 KB
Volume
24
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for concurrent pr
An efficient algorithm for concurrent priority queue heaps
โœ Galen C. Hunt; Maged M. Michael; Srinivasan Parthasarathy; Michael L. Scott ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 628 KB

We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to , but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to

An efficient clustering algorithm for pa
An efficient clustering algorithm for partitioning parallel programs
โœ Piyush Maheshwari; Hong Shen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled ลฝ . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm