Pages that link to "Item:Q962830"
From MaRDI portal
The following pages link to Fast exact \(k\) nearest neighbors search using an orthogonal search tree (Q962830):
Displaying 9 items.
- A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing (Q499379) (← links)
- 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)
- Improvement of the fast exact pairwise-nearest-neighbor algorithm (Q1010096) (← links)
- An MPCA/LDA based dimensionality reduction algorithm for face recognition (Q1718264) (← links)
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees (Q2035468) (← links)
- Fast neighbor search by using revised \(k\)-d tree (Q2200699) (← links)
- (Q3403220) (← links)