Near-Linear Time Algorithm for n-fold ILPs via Color Coding.
Klaus JansenAlexandra LassotaLars RohwedderPublished in: CoRR (2018)
Keyphrases
- worst case
- dynamic programming
- detection algorithm
- preprocessing
- computational complexity
- times faster
- learning algorithm
- convergence rate
- np hard
- experimental evaluation
- optimization algorithm
- search space
- computational cost
- simulated annealing
- particle swarm optimization
- matching algorithm
- coding scheme
- color constancy
- inter frame
- expectation maximization
- high accuracy
- significant improvement
- search algorithm
- optimal solution
- image segmentation