Pages that link to "Item:Q802864"

The following pages link to Refinements to nearest-neighbor searching in k-dimensional trees (Q802864):

Displaying 32 items.

• Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
• Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach (Q513664) (← links)
• Index structures for fast similarity search for real vectors. II (Q722065) (← links)
• A counter example to a monotonicity property of k-d trees (Q789903) (← 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)
• The efficiency of using k-d trees for finding nearest neighbors in discrete space (Q1092665) (← links)
• Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
• Learning good prototypes for classification using filtering and abstraction of instances (Q1601566) (← links)
• Resilient \(k\)-d trees: \(k\)-means in space revisited (Q1762186) (← links)
• Generalised kernel weighted fuzzy c-means clustering algorithm with local information (Q1795024) (← links)
• Expected time analysis for Delaunay point location (Q1882851) (← links)
• Accounting for boundary effects in nearest-neighbor searching (Q1923772) (← links)
• Random projection-based auxiliary information can improve tree-based nearest neighbor search (Q2055550) (← links)
• Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds (Q2111184) (← links)
• Fast neighbor search by using revised \(k\)-d tree (Q2200699) (← links)
• Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591) (← links)
• Efficient data structures for model-free data-driven computational mechanics (Q2237265) (← links)
• Randomized partition trees for nearest neighbor search (Q2345949) (← links)
• Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820) (← links)
• Familiarity based unified visual attention model for fast and robust object recognition (Q2654298) (← links)
• Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
• Squarish \(k\)-\(d\) trees (Q2706131) (← links)
• Randomly-oriented k-d Trees Adapt to Intrinsic Dimension (Q2957480) (← links)
• (Q3403220) (← links)
• Rank Selection in Multidimensional Data (Q3557059) (← links)
• EFFICIENT NEIGHBOR SEARCHING IN NONLINEAR TIME SERIES ANALYSIS (Q4374631) (← links)
• Neighbours on a grid (Q5054822) (← links)
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization (Q5056141) (← links)
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
• Reliable updates of the transformation in the iterative closest point algorithm (Q5963683) (← links)
• An optimal-transport finite-particle method for mass diffusion (Q6084533) (← links)