Name
Abstract | ||
|---|---|---|
Given a set S of m points stored on a reconfigurable mesh computer of size n×n, one point per processing element (PE). In this paper we present a parallel method for solving the k-Nearest Neighbor problem (k-NN). This method permits each point of S to know its k-NN (0km). The corresponding algorithm requires that each PE must have 2k registers where it stores the (x,y) coordinates of its k-NN in a given order. This algorithm has a complexity of O(log h+k2) times, where h is a maximal number of points within a row of the mesh. This complexity is reduced to O(k2) times, using an appropriate procedure which demonstrates the power of the reconfiguration operations carried out by the processors, and the polymorphic properties of the mesh. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1023/A:1013920332390 | Journal of Intelligent and Robotic Systems |
Keywords | Field | DocType |
appropriate procedure,maximal number,parallel method,k-nearest neighbor problem,polymorphic property,simd architecture,corresponding algorithm,reconfigurable mesh computer,data analysis,m point,parallel processing,reconfiguration operation,k-nearest neighbor,fast algorithm,reconfigurable mesh computer.,processing element,polymorphism,k nearest neighbor | k-nearest neighbors algorithm,Reconfigurable mesh,Computer science,Parallel computing,Parallel processing,Algorithm,Processing element,Simd architecture,Control reconfiguration | Journal |
Volume | Issue | ISSN |
32 | 3 | 1573-0409 |
Citations | PageRank | References |
1 | 0.36 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Omar Bouattane | 1 | 11 | 10.43 |
| J. Elmesbahi | 2 | 4 | 1.11 |
| M. Khaldoun | 3 | 2 | 0.72 |
| A. Rami | 4 | 3 | 0.75 |