Pages that link to "Item:Q1209329"
From MaRDI portal
The following pages link to Approximate closest-point queries in high dimensions (Q1209329):
Displaying 15 items.
- Decomposable algorithms for nearest neighbor computing (Q436812) (← links)
- Approximate range searching in external memory (Q627532) (← links)
- Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
- Approximate range searching (Q1595401) (← links)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization (Q2379866) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS (Q3521595) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
- (Q5111687) (← links)
