The following pages link to (Q3403220):
Displaying 8 items.
- Refinements to nearest-neighbor searching in k-dimensional trees (Q802864) (← links)
- Fast \(k\)-nearest-neighbor search based on projection and triangular inequality (Q854187) (← links)
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree (Q854189) (← links)
- Fast exact \(k\) nearest neighbors search using an orthogonal search tree (Q962830) (← links)
- Fast neighbor search by using revised \(k\)-d tree (Q2200699) (← links)
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767) (← links)
- PCA-based branch and bound search algorithms for computing K nearest neighbors (Q4419531) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
