Euclid Meets Bézout: Intersecting Algebraic Plane Curves with the Euclidean Algorithm.
Jan HilmarChris SmythPublished in: Am. Math. Mon. (2010)
Keyphrases
- optimization algorithm
- experimental evaluation
- detection algorithm
- linear programming
- preprocessing
- computational cost
- recognition algorithm
- learning algorithm
- dynamic programming
- np hard
- k means
- three dimensional
- cost function
- simulated annealing
- computational complexity
- times faster
- search space
- segmentation algorithm
- optimal solution
- similarity measure
- clustering method
- b spline