An efficient algorithm to search for minimal closed covers in sequential machines.
Ruchir PuriJun GuPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1993)
Keyphrases
- computational complexity
- search strategy
- experimental evaluation
- search space
- learning algorithm
- cost function
- dynamic programming
- k means
- computational cost
- preprocessing
- optimization algorithm
- solution space
- neural network
- optimal solution
- matching algorithm
- detection algorithm
- times faster
- exhaustive search
- recognition algorithm
- worst case
- computationally efficient
- particle swarm optimization
- search algorithm
- objective function
- sequential search
- convergence rate
- global search
- memory efficient
- convex hull
- path planning
- segmentation algorithm
- theoretical analysis
- expectation maximization
- high accuracy
- motion estimation
- video sequences