Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-012-9638-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-012-9638-2 / rank | |||
Normal rank | |||
Latest revision as of 15:11, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions |
scientific article |
Statements
Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (English)
0 references
13 May 2013
0 references
data structures
0 references
indexing schemes
0 references
similarity search
0 references
Vapnik-Chernonenkis theory
0 references
algorithm performance
0 references
0 references
0 references
0 references
