A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes.
Koyo HayashiPublished in: CoRR (2017)
Keyphrases
- worst case
- computational complexity
- objective function
- significant improvement
- computational cost
- optimization algorithm
- dynamic programming
- high accuracy
- probabilistic model
- tree structure
- detection algorithm
- expectation maximization
- learning algorithm
- experimental evaluation
- np hard
- cost function
- preprocessing
- matching algorithm
- recognition algorithm
- improved algorithm