Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions |
scientific article; zbMATH DE number 6162391
| 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; zbMATH DE number 6162391 |
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
