A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes.
Koyo HayashiPublished in: Discret. Comput. Geom. (2021)
Keyphrases
- worst case
- computational complexity
- optimal solution
- learning algorithm
- dynamic programming
- probabilistic model
- optimization algorithm
- np hard
- preprocessing
- k means
- experimental evaluation
- computational cost
- times faster
- theoretical analysis
- expectation maximization
- strongly polynomial
- approximation ratio
- recognition algorithm
- matching algorithm
- simulated annealing
- search algorithm
- cost function
- np complete
- segmentation algorithm
- objective function
- high accuracy
- neural network
- improved algorithm
- search space