首页 | 本学科首页   官方微博 | 高级检索  
     


An efficient algorithm for row minima computations on basicreconfigurable meshes
Authors:Nakano  K Olariu  S
Affiliation:Dept. of Electr. Eng. & Comput. Sci., Nagoya Inst. of Technol.;
Abstract:A matrix A of size m×n containing items from a totally ordered universe is termed monotone if, for every i, j, 1⩽i2. In case m=nϵ for some constant ϵ, (0<ϵ⩽1), our algorithm runs in O(log log n) time
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号