FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM

DOI10.1080/01495739808947358MaRDI QIDQ4240886zbMATH OpenOpenAlexFDO

Authors Keqin Li, Yi Pan, S. Q. Zheng

Publication date 29 June 1999

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01495739808947358

zbMATH Keywords

nearest neighbor problem

Mathematics Subject Classification ID

Distributed algorithms (68W15) Mathematical problems of computer architecture (68M07)

Recommendations

• An efficient \(O(1)\) time 3D all nearest neighbor algorithm from image processing perspective
• A fast algorithm for k-nearest neighbor problem on a reconfigurable mesh computer
• Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
• scientific article; zbMATH DE number 1751891

Cites work

• MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗

Cited in

(8)

• A Neighbor-finding Algorithm for Bincode-based Images on Reconfigurable Meshes
• Computing nearest neighbors in real time
• An efficient \(O(1)\) time 3D all nearest neighbor algorithm from image processing perspective
• A fast algorithm for \(k\)-nearest neighbor problem on a reconfigurable mesh computer
• A new computation of shape moments via quadtree decomposition
• scientific article; zbMATH DE number 2134687 (Why is no real title available?)
• Repetitions detection on a linear array with reconfigurable pipelined bus system
• Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system*

This page was built for publication: FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240886)