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

DOI10.1080/01495739808947358zbMATH Open0916.68005OpenAlexW2168090306MaRDI QIDQ4240886FDOQ4240886

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

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

zbMATH Keywords

nearest neighbor problem

Mathematics Subject Classification ID

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

Cites Work

• MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗

Cited In (8)

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

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)