An Algorithm for Approximating Implicit Functions by Polynomials without Higher-Order Differentiability.
Kyung Soo RimPublished in: CoRR (2023)
Keyphrases
- higher order
- learning algorithm
- worst case
- high accuracy
- cost function
- dynamic programming
- times faster
- significant improvement
- improved algorithm
- matching algorithm
- optimization algorithm
- probabilistic model
- k means
- computational complexity
- experimental evaluation
- computational cost
- similarity measure
- simulated annealing
- linear programming
- preprocessing
- segmentation algorithm
- multiscale
- np hard
- convex hull
- high order
- tree structure
- detection algorithm
- pairwise
- computationally efficient
- expectation maximization
- markov random field
- evolutionary algorithm
- data sets