Near-Linear Time Algorithm for n-Fold ILPs via Color Coding.
Klaus JansenAlexandra LassotaLars RohwedderPublished in: SIAM J. Discret. Math. (2020)
Keyphrases
- expectation maximization
- optimal solution
- worst case
- detection algorithm
- learning algorithm
- cost function
- significant improvement
- color images
- probabilistic model
- computational cost
- matching algorithm
- computational complexity
- convex hull
- search space
- times faster
- color image segmentation
- search algorithm
- similarity measure
- segmentation algorithm
- decision trees
- minimum length
- suffix array
- dynamic programming
- np hard
- k means
- preprocessing
- data structure
- objective function