Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ · polylog(Δ))-algorithm for knapsack, proximity and sparsity.
Dmitry V. GribanovPublished in: CoRR (2020)
Keyphrases
- computational complexity
- objective function
- improved algorithm
- dynamic programming
- optimal solution
- detection algorithm
- computational cost
- linear programming
- k means
- times faster
- learning algorithm
- high accuracy
- np hard
- cost function
- preprocessing
- optimization algorithm
- expectation maximization
- theoretical analysis
- knapsack problem
- packing problem
- computationally efficient
- worst case
- experimental evaluation
- upper bound
- classification algorithm
- knn
- recognition algorithm
- high dimensional
- data sets