Reconfigurable meshes and image processing

DOI10.1016/0016-0032(94)90034-5zbMath0939.68909OpenAlexW2024106002MaRDI QIDQ1898157

Sartaj K. Sahni

Publication date: 26 February 1996

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(94)90034-5

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Microeconomic theory (price theory and economic markets) (91B24)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constant time sorting on a processor array with a reconfigurable bus system
• Efficient parallel computations on the reduced mesh of trees organization
• Sorting \(n\) numbers on \(n\times n\) reconfigurable meshes with buses
• Mesh-Connected Computers with Broadcasting
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Some Complexity Results for Matrix Computations on Parallel Processors
• Interval Graph Problems on Reconfigurable Meshes

This page was built for publication: Reconfigurable meshes and image processing