On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields.
Christian PorterShanxiang LyuCong LingPublished in: CoRR (2019)
Keyphrases
- learning algorithm
- experimental evaluation
- computational complexity
- times faster
- objective function
- optimization algorithm
- optimal solution
- detection algorithm
- preprocessing
- pairwise
- k means
- selection algorithm
- cost function
- improved algorithm
- theoretical analysis
- probabilistic model
- computational cost
- particle swarm optimization
- expectation maximization
- dynamic programming
- neural network
- high accuracy
- segmentation algorithm
- convex hull
- significant improvement