An iterative algorithm for the binate covering problem.
M. PipponziFabio SomenziPublished in: EURO-DAC (1990)
Keyphrases
- computational complexity
- theoretical analysis
- preprocessing
- detection algorithm
- probabilistic model
- learning algorithm
- objective function
- path planning
- cost function
- experimental evaluation
- iterative optimization
- data sets
- times faster
- np hard
- k means
- computational cost
- worst case
- high accuracy
- dynamic programming
- segmentation algorithm
- image sequences
- iterative algorithms
- single pass
- improved algorithm
- recognition algorithm
- convex hull
- optimal solution
- lower bound
- classification algorithm
- search space
- computationally efficient
- input data
- linear programming