Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-012-9638-2 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-012-9638-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089407614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds for nearest neighbor search and related problems in the cell probe model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot selection techniques for proximity searching in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a model of indexability and its bounds for range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of similarity search: dimensionality curse and concentration of measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic approach to intrinsic dimension of a dataset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexability, concentration, and VC theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of multidimensional and metric data structures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfying general proximity/similarity queries with metric trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and generalisation. With applications to neural networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity search. The metric space approach. / rank
 
Normal 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
    0 references
    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

    Identifiers