Conference paper
Convergence properties of multi-dimensional stack filters
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
We consider the problem of computing the median of a bag of 2n numbers by using communicating processes, each having some of the numbers in its local memory. The memories are assumed to be disjoint. For two processes an algorithm is given. Its time and space complexity is linear while the communication complexity is 2 log2 n. A lower bound of log2 n on the communication complexity is derived. Thus the algorithm is optimal up to a constant. © 1982.
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Sankar Basu
Journal of the Franklin Institute