Algorithms for distance problems in planar complexes of global nonpositive curvature.
Daniela MaftuleacPublished in: CoRR (2013)
Keyphrases
- optimization problems
- related problems
- benchmark problems
- difficult problems
- practical problems
- computational cost
- computationally efficient
- learning algorithm
- orders of magnitude
- run times
- partial solutions
- test problems
- data structure
- multiscale
- machine learning algorithms
- theoretical analysis
- metaheuristic
- knn
- significant improvement
- search algorithm
- similarity measure
- problems in computer vision
- theoretical guarantees
- np hard problems
- convex optimization problems
- clustering algorithm