Sciweavers

2 search results - page 1 / 1
» Comparison-Sorting and Selecting in Totally Monotone Matrice...
Sort
View
TPDS
1998
92views more  TPDS 1998»
14 years 11 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu