An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem.
Cristian FrasinaruMadalina RaschipPublished in: CPAIOR (2019)
Keyphrases
- dynamic programming
- optimal solution
- computational cost
- computational complexity
- worst case
- times faster
- optimization algorithm
- optimal path
- preprocessing
- detection algorithm
- experimental evaluation
- similarity measure
- worst case time complexity
- space complexity
- recognition algorithm
- learning algorithm
- cost function
- lower bound
- sorting algorithms
- scales linearly
- locally optimal
- path length
- objective function
- optimal parameters
- window size
- probabilistic model
- search space
- convergence rate
- memory requirements
- k means
- matching algorithm
- significant improvement
- segmentation algorithm