A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations.
Jérémy BerthomieuJean-Charles FaugèrePublished in: ISSAC (2018)
Keyphrases
- experimental evaluation
- dynamic programming
- learning algorithm
- computational complexity
- k means
- cost function
- segmentation algorithm
- simulated annealing
- detection algorithm
- computational cost
- significant improvement
- preprocessing
- matching algorithm
- times faster
- data sets
- recognition algorithm
- improved algorithm
- linear complexity
- theoretical analysis
- worst case
- high accuracy
- optimal solution
- particle swarm optimization
- clustering method
- np hard
- support vector
- convergence rate
- semantic relations
- objective function
- bayesian networks
- polynomially bounded