Multidimensional binary search trees used for associative searching
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Quad trees a data structure for retrieval on composite keys | 1974 | 2,038 |
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Anomaly detection | 2009 | 11,511 |
| Approximate nearest neighbors | 1998 | 4,240 |
| The Quadtree and Related Hierarchical Data Structures | 1984 | 2,207 |
| Locally Weighted Learning | 1997 | 1,691 |
| Algorithms for Mining Distance-Based Outliers in Large Datasets | 1998 | 1,532 |
Links
Topics
| Algorithms and Data Compression | Computer Science |
| Data Management and Algorithms | Computer Science |
| Advanced Image and Video Retrieval Techniques | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports1 author record(s) attached.
- supports6 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 5cad55ac5d4d41e1…