A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata.
Daniel KirstenPublished in: RAIRO Theor. Informatics Appl. (2008)
Keyphrases
- times faster
- detection algorithm
- learning algorithm
- preprocessing
- dynamic programming
- theoretical analysis
- np hard
- worst case
- improved algorithm
- noisy data
- high accuracy
- experimental evaluation
- cost function
- search space
- optimal solution
- linear programming
- input data
- expectation maximization
- significant improvement
- k means
- clustering method
- similarity measure