On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm.
Daniel AugotAlexander ZehPublished in: ISIT (2008)
Keyphrases
- computational complexity
- dynamic programming
- worst case
- preprocessing
- computational cost
- improved algorithm
- computationally efficient
- cost function
- optimization algorithm
- evolutionary algorithm
- detection algorithm
- np hard
- experimental evaluation
- particle swarm optimization
- clustering method
- mathematical model
- convex hull
- theoretical analysis
- selection algorithm
- single pass
- simulated annealing
- high accuracy
- probabilistic model
- k means
- objective function
- linear programming
- expectation maximization
- search space
- optimal solution
- multiscale
- memory requirements
- bayesian networks
- similarity measure
- decision trees