Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions - Pestov, Vladimir (Algorithmica, 2013)
Keywords: Algorithm Analysis and Problem Complexity; Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Computer Science; Computer science; control theory; systems; Computer Systems Organization and Communication Networks; Data processing. List processing. Character string processing; Data Structures and Information Theory; Exact sciences and technology; Mathematics of Computing; Memory organisation. Data processing; Software; Theoretical computing; Theory of Computation; Algorithms and data structures; Algorithm performance; Vapnik-Chernonenkis theory; Indexing schemes; Similarity search; Lower bound; Nearest neighbour; Automatic classification; Dimensionality; Tree(graph); Probability distribution; Modeling; Decision function; Lipschitz function; Probability learning; Metric; Asymptotic approximation; Data structure; Deterministic approach; Indexing