An algorithm for computing the Arf closure of an algebroid curve with more than one branch.
Nicola MaugeriGiuseppe ZitoPublished in: Int. J. Algebra Comput. (2019)
Keyphrases
- experimental evaluation
- learning algorithm
- times faster
- computationally efficient
- detection algorithm
- search space
- worst case
- np hard
- computational cost
- dynamic programming
- cost function
- objective function
- improved algorithm
- data sets
- k means
- linear programming
- association rules
- theoretical analysis
- segmentation algorithm
- lower bound
- tree structure
- classification algorithm
- convergence rate