Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system.
We present efficient algorithms for the nearest neighbor problem defined in an n x n binary image. We show that using a linear array with a reconfigurable pipelined bus system (LARPBS) of n2 processors, the nearest neighbor problem can be solved in O (log log n) time, and using an LARPBS of n 2+e pr...
| الحاوية / القاعدة: | Parallel algorithms and applications. 13, 1 (1998). |
|---|---|
| المؤلف الرئيسي: | |
| التنسيق: | مقال |
| اللغة: | English |
| الموضوعات: |