Algorithm Design Using Traversals of the Covering Relation.
Andrew L. BurrowPublished in: ICCS (2009)
Keyphrases
- experimental evaluation
- similarity measure
- expectation maximization
- dynamic programming
- cost function
- search space
- learning algorithm
- times faster
- detection algorithm
- computationally efficient
- high accuracy
- k means
- computational complexity
- single pass
- np hard
- search algorithm
- computational cost
- recognition algorithm
- worst case
- optimal solution
- convergence rate
- experimental study
- objective function
- selection algorithm
- neural network
- matching algorithm
- image processing
- segmentation algorithm
- case study
- user interface
- scheduling problem
- preprocessing
- significant improvement