Decomposable algorithms for nearest neighbor computing

DOI10.1016/j.jpdc.2007.12.005zbMath1243.68061OpenAlexW2078761162MaRDI QIDQ436812

Ahmed Salim, Ahmed M. Khedr

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

zbMATH Keywords

mobile agentsdistributed databasesnearest neighbordecomposable algorithmsnearest pairstationary agentsvertically and horizontally partitioned

Mathematics Subject Classification ID

Database theory (68P15) Distributed systems (68M14)

Cites Work

• Approximate closest-point queries in high dimensions
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Distributed Computing - IWDC 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item