A polynomial time algorithm for solving the closest vector problem in zonotopal lattices.
S. Thomas McCormickBritta PeisRobert ScheidweilerFrank VallentinPublished in: CoRR (2020)
Keyphrases
- computational complexity
- experimental evaluation
- learning algorithm
- worst case
- special case
- dynamic programming
- times faster
- similarity measure
- search space
- np hard
- detection algorithm
- optimization algorithm
- high accuracy
- strongly polynomial
- optimal solution
- gradient projection
- quadratic programming
- segmentation algorithm
- theoretical analysis
- simulated annealing
- computational cost
- cost function
- preprocessing
- genetic algorithm
- clustering method
- feature selection
- convex hull
- recognition algorithm
- branch and bound search
- k means