On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance.
P. Chella PandianPublished in: Discret. Math. Algorithms Appl. (2017)
Keyphrases
- euclidean distance
- distance metric
- distance measure
- similarity measure
- feature vectors
- image space
- similarity measurement
- euclidean space
- distance function
- mahalanobis distance
- data points
- dynamic time warping
- dimensionality reduction
- manhattan distance
- high dimensional spaces
- cosine distance
- feature selection
- neural network