On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces.
G. FazekasVladimir I. LevenshteinPublished in: J. Comb. Theory, Ser. A (1995)
Keyphrases
- metric space
- upper bound
- distance function
- similarity search
- triangle inequality
- lower bound
- similarity queries
- upper and lower bounds
- distance measure
- knn
- multidimensional index
- distance computation
- euclidean distance
- probability measures
- searching in metric spaces
- similarity searching
- high dimensional
- range queries
- nearest neighbor queries
- point sets
- access methods
- similarity join
- vector space
- nearest neighbor
- dimensional vector
- partially ordered sets
- sample complexity
- data sets
- feature extraction
- machine learning
- neural network