A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D.
Arnaud Girès Fobasso TchindaEmmanuel FouotsaCelestin Nkuimi JugniaPublished in: SN Comput. Sci. (2023)
Keyphrases
- cost function
- tree structure
- experimental evaluation
- improved algorithm
- optimal solution
- times faster
- dynamic programming
- computational cost
- probabilistic model
- learning algorithm
- gradient projection
- weight vector
- recognition algorithm
- matching algorithm
- objective function
- feature extraction
- simulated annealing
- computationally efficient
- segmentation algorithm
- ant colony optimization
- np hard
- significant improvement
- k means
- knapsack problem
- computational complexity
- similarity measure
- polynomially bounded