On the finiteness and periodicity of the p-adic Jacobi-Perron algorithm.
Nadir MurruLea TerraciniPublished in: Math. Comput. (2020)
Keyphrases
- learning algorithm
- dynamic programming
- computationally efficient
- preprocessing
- linear programming
- computational complexity
- detection algorithm
- theoretical analysis
- simulated annealing
- np hard
- improved algorithm
- optimal solution
- search space
- probabilistic model
- worst case
- high accuracy
- objective function
- particle swarm optimization
- estimation algorithm
- similarity measure
- segmentation algorithm
- convex hull
- path planning
- single pass
- classification algorithm
- cost function
- significant improvement
- lower bound
- multiscale
- face recognition