Optimal choice of discriminators in a balanced K-D binary search tree (Q1154274): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Multidimensional binary search trees used for associative searching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multidimensional Binary Search Trees in Database Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On nonlinear optimization in integers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal partial-match retrieval / rank | |||
Normal rank | |||
Revision as of 12:42, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal choice of discriminators in a balanced K-D binary search tree |
scientific article |
Statements
Optimal choice of discriminators in a balanced K-D binary search tree (English)
0 references
1981
0 references
partial-match search
0 references
