Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
A bus system that can change dynamically to suit computational needs is referred to as reconfigurable. The authors are interested in obtaining fast algorithms for a number of low-level vision tasks on a two-dimensional mesh augmented with a reconfigurable bus system (reconfigurable mesh). Specifically, for an n*n digitized image stored one pixel per processor they present O(loglogn) algorithms to compute low-level descriptors including perimeter, area, histogram, median row, center as well as several moments.