A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations.
Daniele MicciancioPanagiotis VoulgarisPublished in: STOC (2010)
Keyphrases
- benchmark problems
- learning algorithm
- test problems
- experimental evaluation
- k means
- computational complexity
- times faster
- computational cost
- significant improvement
- dynamic programming
- optimal solution
- probabilistic model
- worst case
- high accuracy
- detection algorithm
- linear complexity
- optimization algorithm
- search space
- objective function
- matching algorithm
- computational geometry
- linear programming
- optimal or near optimal
- cost function
- lattice structure
- deterministic domains
- segmentation algorithm
- computationally efficient
- optimization problems
- preprocessing
- similarity measure