A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata.
Ken HiguchiEtsuji TomitaMitsuo WakatsukiPublished in: IEICE Trans. Inf. Syst. (1995)
Keyphrases
- detection algorithm
- computational complexity
- dynamic programming
- objective function
- computational cost
- optimization algorithm
- search space
- worst case
- experimental evaluation
- approximation ratio
- matching algorithm
- segmentation algorithm
- probabilistic model
- preprocessing
- cost function
- linear programming
- k means
- optimal solution
- reinforcement learning
- approximation algorithms
- recognition algorithm
- image segmentation