On the Correctness of a Branch Displacement Algorithm.
Jaap BoenderClaudio Sacerdoti CoenPublished in: TACAS (2014)
Keyphrases
- computational complexity
- classification algorithm
- preprocessing
- worst case
- experimental evaluation
- detection algorithm
- optimal solution
- matching algorithm
- high accuracy
- np hard
- experimental study
- theoretical analysis
- dynamic programming
- cost function
- k means
- search space
- times faster
- data structure
- neural network
- estimation algorithm
- segmentation method
- selection algorithm
- segmentation algorithm
- expectation maximization
- simulated annealing
- markov random field
- support vector
- multiscale
- face recognition