Now showing items 1-6 of 6
Supporting divide-and-conquer algorithms for image processing
(Elsevier, 1987-02)
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural ...
Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
(Springer-Verlag; Springer-Verlag New York Inc., 1992-12)
This paper gives hypercube algorithms for some simple problems involving geometric properties of sets of points. The properties considered emphasize aspects of convexity and domination. Efficient algorithms are given for ...
Embeddings in hypercubes
(Elsevier, 1988)
One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasks and their inter-communication ...
Intensive hypercube communication Prearranged communication in link-bound machines,
(Elsevier, 1990-10)
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposing a matrix, histogramming, sending a (long) message from one node to another, broadcasting a message from one node to all ...
Computing convexity properties of images on a pyramid computer
(Springer-Verlag; Springer-Verlag New York Inc., 1991-12)
We present efficient parallel algorithms for using a pyramid computer to determine convexity properties of digitized black/white pictures and labeled figures. Algorithms are presented for deciding convexity, identifying ...