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

Parallel curve matching on the Connection Machine

โœ Scribed by Ling Tony Chen; Larry S Davis

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
556 KB
Volume
14
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Quark propagator on the Connection Machi
Quark propagator on the Connection Machine
โœ T. Lippert; K. Schilling; N. Petkov ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 486 KB
A Data Parallel Algorithm for Solving th
A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine
โœ N. Copty; S. Ranka; G. Fox; R.V. Shankar ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare

Modeling Semantic Networks on the Connec
Modeling Semantic Networks on the Connection Machine
โœ S.H. Chung; D.I. Moldovan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1007 KB

Massively parallel architectures such as the Connection Machine can process large knowledge bases efficiently. An appropriate knowledge representation scheme for parallel processing is a semantic network. We have defined and implemented software data structures, marker propagation rules, and an inst