Pages that link to "Item:Q4198073"
From MaRDI portal
The following pages link to Multidimensional Binary Search Trees in Database Applications (Q4198073):
Displayed 12 items.
- Secondary attribute retrieval using tree data structures (Q798014) (← links)
- Fast \(k\)-nearest-neighbor search based on projection and triangular inequality (Q854187) (← links)
- A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves (Q905994) (← links)
- Improvement of the \(k\)-means clustering filtering algorithm (Q947996) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Optimal choice of discriminators in a balanced K-D binary search tree (Q1154274) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- Multidimensional bisection: A dual viewpoint (Q1324321) (← links)
- The properties of random trees (Q1825678) (← links)
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. (Q1853173) (← links)
- KpyrRec: a recursive multidimensional indexing structure (Q3499022) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)