A Euclidean Algorithm for Binary Cycles with Minimal Variance.
Luca GhezziRoberto BaldacciPublished in: CoRR (2018)
Keyphrases
- experimental evaluation
- expectation maximization
- worst case
- computational complexity
- k means
- significant improvement
- dynamic programming
- times faster
- high accuracy
- optimal solution
- binary tree
- convex hull
- computational cost
- cost function
- preprocessing
- learning algorithm
- denoising
- probabilistic model
- computationally efficient
- ant colony optimization
- video sequences
- recognition algorithm
- prediction error