scientific article; zbMATH DE number 1893569
From MaRDI portal
Cited in
(16)- Probably correct \(k\)-nearest neighbor search in high dimensions
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- scientific article; zbMATH DE number 5811505 (Why is no real title available?)
- Decomposable algorithms for nearest neighbor computing
- Some approaches to improve tree-based nearest neighbour search algorithms
- scientific article; zbMATH DE number 1445326 (Why is no real title available?)
- scientific article; zbMATH DE number 2066190 (Why is no real title available?)
- Nearest-neighbor searching under uncertainty. I
- The vertex morphing method for node-based shape optimization
- scientific article; zbMATH DE number 1830741 (Why is no real title available?)
- Random projection-based auxiliary information can improve tree-based nearest neighbor search
- Randomized partition trees for nearest neighbor search
- Expected-Case Complexity of Approximate Nearest Neighbor Searching
- scientific article; zbMATH DE number 2065610 (Why is no real title available?)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
- Analysis of an adaptive algorithm to find the two nearest neighbors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4801190)