On the correctness of a branch displacement algorithm
Jaap BoenderClaudio Sacerdoti CoenPublished in: CoRR (2012)
Keyphrases
- high accuracy
- significant improvement
- optimization algorithm
- experimental evaluation
- times faster
- k means
- np hard
- preprocessing
- search space
- segmentation algorithm
- cost function
- memory requirements
- improved algorithm
- matching algorithm
- classification algorithm
- detection algorithm
- neural network
- space complexity
- theoretical analysis
- computational cost
- dynamic programming
- computational complexity
- optimal solution
- objective function
- multiscale
- input data
- linear programming
- ant colony optimization
- convex hull
- similarity measure