On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields.
Christian PorterShanxiang LyuCong LingPublished in: ITW (2019)
Keyphrases
- objective function
- detection algorithm
- dynamic programming
- optimal solution
- computational complexity
- computational cost
- preprocessing
- significant improvement
- improved algorithm
- k means
- worst case
- cost function
- experimental evaluation
- high accuracy
- classification algorithm
- matching algorithm
- spline interpolation
- optimization algorithm
- space complexity
- data sets
- distance measure
- simulated annealing
- np hard
- search space
- linear programming
- segmentation algorithm
- clustering method
- probabilistic model
- recognition algorithm
- selection algorithm
- exhaustive search
- high dimensional
- bayesian networks