A polynomial algorithm for minimizing discrete convic functions in fixed dimension.
Sergey I. VeselovDmitry V. GribanovNikolai Yu. ZolotykhAleksandr Yu. ChirkovPublished in: Discret. Appl. Math. (2020)
Keyphrases
- detection algorithm
- experimental evaluation
- segmentation algorithm
- preprocessing
- theoretical analysis
- computational cost
- matching algorithm
- improved algorithm
- learning algorithm
- dynamic programming
- objective function
- search space
- np hard
- optimization algorithm
- basis functions
- cost function
- k means
- computational complexity
- computational geometry
- worst case
- convergence rate
- continuous domains
- fixed size
- ant colony optimization
- expectation maximization
- high accuracy
- significant improvement
- reinforcement learning
- similarity measure
- clustering algorithm