Improved Analysis of Kannan's Shortest Lattice Vector Algorithm
Guillaume HanrotDamien StehléPublished in: CoRR (2007)
Keyphrases
- optimization algorithm
- improved algorithm
- cost function
- computational complexity
- preprocessing
- theoretical analysis
- k means
- worst case
- experimental evaluation
- dynamic programming
- detection algorithm
- shortest path
- matching algorithm
- computational cost
- learning algorithm
- times faster
- tree structure
- expectation maximization
- convergence rate
- lattice structure
- markov random field
- path length
- segmentation algorithm
- linear programming
- data sets
- significant improvement
- evolutionary algorithm
- objective function
- genetic algorithm
- neural network