Data Movement Techniques for the Pyramid Computer
From MaRDI portal
Recommendations
- Computing convexity properties of images on a pyramid computer
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- scientific article; zbMATH DE number 1432332
- Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
- scientific article; zbMATH DE number 2084487
Cited in
(14)- Line connectivity algorithms for an asynchronous pyramid computer
- A bypassing path based routing algorithm for the pyramid structures
- The \(3^{*}\)-connected property of pyramid networks
- HETEROGENEOUS ALGORITHMS FOR IMAGE UNDERSTANDING ARCHITECTURE∗
- The triangular pyramid: Routing and topological properties
- Parallel computation of discrete Voronoi diagrams (extended abstract)
- Computing convexity properties of images on a pyramid computer
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
- Algorithmic construction of Hamiltonians in pyramids
- Distance-edge-monitoring sets of networks
- Parallel computation of distance transforms
- Properties of a hierarchical network based on the star graph
- Two-node-Hamiltonicity of enhanced pyramid networks
This page was built for publication: Data Movement Techniques for the Pyramid Computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774926)
