Now showing items 1-4 of 4
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 ...
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 ...