Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in E2 Instead of O(N^2) or O(N lgN).

Václav Skala Michal Smolik

Published in: ICCSA (1) (2019)

Keyphrases

worst case
maximum distance
computational complexity
learning algorithm
np hard
optimal solution
image retrieval
feature selection
particle swarm optimization
high dimensional
feature vectors
image processing
probabilistic model
input data
tree structure
convergence rate
machine learning