An efficient sequential clustering method
โ Scribed by P. Trahanias; E. Skordalakis
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 346 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A reformulated set of equations for the closed-shell singles and doubles couple&luster (CCSD ) method is presented. A computational cost of f&t: +7n$zi + ln# for the n6 steps is obtained, where n, is the number of virtual molecular orbitals included in the CCSD procedure, n, is the number of doubly
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
phological openings and closings. The class of alternating filters (AFs), composed of morphological openings and In this note, an efficient class of alternating sequential filters (ASFs) in mathematical morphology is presented to reduce the closings, has been demonstrated to be useful in image compu