Pages that link to "Item:Q2200699"
From MaRDI portal
The following pages link to Fast neighbor search by using revised \(k\)-d tree (Q2200699):
Displaying 11 items.
- Refinements to nearest-neighbor searching in k-dimensional trees (Q802864) (← 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)
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation (Q2127042) (← links)
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591) (← links)
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767) (← links)
- Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820) (← links)
- Fast stepwise regression based on multidimensional indexes (Q2666779) (← links)
- (Q3403220) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- Automata, Languages and Programming (Q5716751) (← links)