An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem.
Cristian FrasinaruMadalina RaschipPublished in: CoRR (2017)
Keyphrases
- optimal solution
- space complexity
- recognition algorithm
- dynamic programming
- scales linearly
- computational complexity
- times faster
- worst case
- locally optimal
- globally optimal
- experimental evaluation
- simulated annealing
- optimization algorithm
- detection algorithm
- high accuracy
- learning algorithm
- memory requirements
- similarity measure
- segmentation algorithm
- search space
- preprocessing
- objective function
- matching algorithm
- closed form
- expectation maximization
- computational cost
- convergence rate
- np hard
- significant improvement
- fixed size