A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials.
Mark GiesbrechtAlbert HeinlePublished in: CASC (2012)
Keyphrases
- computational complexity
- worst case
- learning algorithm
- significant improvement
- dynamic programming
- segmentation algorithm
- high accuracy
- np hard
- cost function
- experimental evaluation
- matching algorithm
- detection algorithm
- recognition algorithm
- theoretical analysis
- objective function
- times faster
- optimization algorithm
- expectation maximization
- computational cost
- optimal solution
- input data
- probabilistic model
- special case
- convergence rate
- approximation ratio
- max flow
- polynomial size