Decomposable algorithms for nearest neighbor computing
From MaRDI portal
Publication:436812
DOI10.1016/J.JPDC.2007.12.005zbMATH Open1243.68061OpenAlexW2078761162MaRDI QIDQ436812FDOQ436812
Authors: Ahmed M. Khedr, Ahmed Salim
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.12.005
Recommendations
nearest neighbormobile agentsdecomposable algorithmsdistributed databasesnearest pairstationary agentsvertically and horizontally partitioned
Cites Work
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate closest-point queries in high dimensions
- Learning \(k\)-nearest neighbors classifier from distributed data
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed Computing - IWDC 2003
- Agents for integrating distributed data for complex computations
Cited In (4)
This page was built for publication: Decomposable algorithms for nearest neighbor computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436812)