Distributed computation of the knn graph for large high-dimensional point sets
- 31 March 2007
- journal article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 67 (3), 346-359
- https://doi.org/10.1016/j.jpdc.2006.10.004
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Low-dimensional, free-energy landscapes of protein-folding reactions by nonlinear dimensionality reductionProceedings of the National Academy of Sciences of the United States of America, 2006
- Protein folding by motion planningPhysical Biology, 2005
- The PN-Tree: A Parallel and Distributed Multidimensional IndexDistributed and Parallel Databases, 2005
- Fast range query estimation by N-level tree histogramsData & Knowledge Engineering, 2004
- Combining Nearest Neighbor Classifiers Versus Cross-Validation SelectionStatistical Applications in Genetics and Molecular Biology, 2004
- (Almost) Optimal parallel block access for range queriesInformation Sciences, 2003
- Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular MotionJournal of Computational Biology, 2003
- On the "dimensionality curse" and the "self-similarity blessing"IEEE Transactions on Knowledge and Data Engineering, 2001
- Multiple similarity queries: a basic DBMS operation for mining in metric databasesIEEE Transactions on Knowledge and Data Engineering, 2001
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996