An algorithm for computing minimal bidirectional linear recurrence relations.
Ana SalageanPublished in: ISIT (2008)
Keyphrases
- detection algorithm
- improved algorithm
- learning algorithm
- convergence rate
- computational complexity
- np hard
- experimental evaluation
- computational cost
- dynamic programming
- theoretical analysis
- input data
- worst case
- classification algorithm
- linear systems
- linear complexity
- high accuracy
- cost function
- significant improvement
- k means
- particle swarm optimization
- integer arithmetic
- convex quadratic programming
- closed form
- path planning
- optimization algorithm
- computationally efficient
- denoising
- optimal solution