Fine costs for Euclid's algorithm on polynomials and Farey maps.
Valérie BerthéHitoshi NakadaRie NatsuiBrigitte ValléePublished in: Adv. Appl. Math. (2014)
Keyphrases
- detection algorithm
- experimental evaluation
- dynamic programming
- computational complexity
- learning algorithm
- objective function
- optimal solution
- k means
- linear programming
- computational cost
- computationally efficient
- preprocessing
- np hard
- cost function
- data sets
- theoretical analysis
- optimization algorithm
- tree structure
- path planning
- times faster
- high accuracy
- significant improvement
- search space
- clustering method
- matching algorithm
- recognition algorithm
- estimation algorithm