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

Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses

โœ Scribed by Rong Lin

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
948 KB
Volume
40
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Communication-Efficient Sorting Algorith
Communication-Efficient Sorting Algorithms on Reconfigurable Array of Processors With Slotted Optical Buses
โœ Mounir Hamdi; Chunming Qiao; Yi Pan; J. Tong ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

The reconfigurable array with slotted optical buses (RASOB) has recently received a lot of attention from the research community. In this paper, we first discuss the reconfiguration methods and communication capabilities of the RASOB architecture. Then, we use this architecture for the implementatio

Efficient Parallel Algorithms for Hierar
Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses
โœ Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 225 KB

Clustering is a basic operation in image processing and computer vision, and it plays an important role in unsupervised pattern recognition and image segmentation. While there are many methods for clustering, the single-link hierarchical clustering is one of the most popular techniques. In this pape