An Upper Bound on the Average Number of Iterations of the LLL Algorithm.
Hervé DaudéBrigitte ValléePublished in: Theor. Comput. Sci. (1994)
Keyphrases
- upper bound
- error probability
- worst case
- optimal solution
- detection algorithm
- times faster
- experimental evaluation
- preprocessing
- k means
- cost function
- high accuracy
- execution times
- memory requirements
- lower bound
- computational complexity
- objective function
- learning algorithm
- small number
- np hard
- neural network
- linear programming
- particle swarm optimization
- computational cost
- matching algorithm
- average distance
- lower and upper bounds
- computational effort
- improved algorithm
- input data
- dynamic programming
- convergence rate
- space complexity
- np complete
- similarity measure