A note on shrinking and expanding operations in pyramids
Pattern Recognition Letters
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
Digital Picture Processing
The DMBC: architecture and fundamental operations
ICS '95 Proceedings of the 9th international conference on Supercomputing
Image Processing on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Parallel and Distributed Systems
Mapping pyramids into 3-D meshes
Nordic Journal of Computing
The Grid-Pyramid: A Generalized Pyramid Network
The Journal of Supercomputing
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
The 3*-connected property of pyramid networks
Computers & Mathematics with Applications
ω-wide diameters of enhanced pyramid networks
Theoretical Computer Science
Constructing node-disjoint paths in enhanced pyramid networks
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Capturing an intruder in the pyramid
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
| Hi-index | 0.00 |
Develops two algorithms to perform the q step shrinking and expanding of an N*N binary image on a pyramid computer with an N*N base. The time complexity of both algorithms is O( square root q). However, one uses O( square root q) space per processor, while the per-processor space requirement of the other is O(1).