On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions.
Antti HannukainenSergey KorotovMichal KrízekPublished in: Sci. Comput. Program. (2014)
Keyphrases
- learning algorithm
- search space
- cost function
- np hard
- times faster
- optimal solution
- dynamic programming
- neural network
- improved algorithm
- recognition algorithm
- detection algorithm
- optimization algorithm
- theoretical analysis
- worst case
- experimental evaluation
- significant improvement
- computational complexity
- computational cost
- upper bound
- preprocessing
- probabilistic model
- k means
- search algorithm
- image restoration
- segmentation method
- matching algorithm
- objective function
- decision trees
- data sets
- vertex set