Performance Bounds on the Splitting Algorithm for Binary Testing.
M. R. GareyRonald L. GrahamPublished in: Acta Informatica (1974)
Keyphrases
- learning algorithm
- computational complexity
- preprocessing
- high accuracy
- times faster
- worst case
- computational cost
- dynamic programming
- experimental evaluation
- np hard
- confidence bounds
- binary tree
- error bounds
- theoretical analysis
- lower bound
- optimal solution
- detection algorithm
- feature selection
- recognition algorithm
- matching algorithm
- classification algorithm
- k means
- segmentation algorithm
- particle swarm optimization
- search space
- optimization algorithm
- linear programming
- objective function
- convex hull
- image sequences
- simulated annealing
- space complexity
- image segmentation