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

Optimal algorithms for rectangle problems on a mesh-connected computer

โœ Scribed by Mi Lu; Peter Varman

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
965 KB
Volume
5
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A fast general algorithm for extracting
A fast general algorithm for extracting image features on SIMD mesh-connected computers
โœ Hongchi Shi; Gerhard X. Ritter; Joseph N. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 504 KB

Extracting features of components in an image is an important step for recognition of objects in the image. In this paper, we develop a general formula for extracting some geometric features of image components such as area, perimeter, compactness, height, width, diameter, moments, and centroid. We

A Fast Algorithm for Image Component Lab
A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers
โœ H.C. Shi; G.X. Ritter ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 562 KB

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question of whether there exists an \(O(n)\)-time and \(O(\log n)\)-space local labeling algorithm on SIMD mesh connected co

Optimal-Algorithms for Multipacket Routi
Optimal-Algorithms for Multipacket Routing Problems on Rings
โœ F. Makedon; A. Symvonis ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 643 KB

We study multipacket routing problems on rings of processors. We prove a new lower bound of \(2 n / 3\) routing steps for the case that \(k\), the number of packets per processor, is at most 2 . We also give an algorithm that tightens this lower bound. For the case where \(k>2\), the lower bound is