FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM
作者:
YI PAN,
KEQIN LI,
SI-QING ZHENG,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1998)
卷期:
Volume 13,
issue 1
页码: 1-25
ISSN:1063-7192
年代: 1998
DOI:10.1080/01495739808947358
出版商: Taylor & Francis Group
关键词: Image analysis;Nearest-neighbor problem;Parallel algorithm;Reconfigurable optical bus;Time complexity
数据来源: Taylor
摘要:
We present efficient algorithms for the nearest neighbor problem defined in an n × n binary image. We show that using a linear array with a reconfigurable pipelined bus system (LARPBS) of n2processors, the nearest neighbor problem can be solved in O(loglogn) time, and using an LARPBS of n2+εprocessors, for any fixed constant ε>0. the nearest neighbor problem can be solved in O(l) time. We also show that the nearest neighbor problem can be solved on an LARPBS of n2processors in O(1) time with high probability.
点击下载:
PDF (745KB)
返 回