Now showing items 1-6 of 6
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 ...
Mapping freeze/thaw boundaries with SMMR data
(Elsevier, 1990-08)
Nimbus 7 SMMR data are used to map daily freeze/thaw patterns in the upper Midwest for the fall of 1984. The combination of a low 37 GHz radiobrightness and a negative 10.7, 18 and 37 GHz spectral gradient, [part]Tb/[part]f, ...
Discrete and Continuous Representations of Unobserved Heterogeneity in Choice Modeling
(Kluwer Academic Publishers; Springer Science+Business Media, 1999-08)
We attempt to provide insights into how heterogeneity has been and can be addressed in choice modeling. In doing so, we deal with three topics: Models of heterogeneity, Methods of estimation and Substantive issues. In ...
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 ...