Convergence Characteristics and Computational Cost of Two Algebraic Kernels in Vortex Methods with a Tree-Code Algorithm.
Daehyun WeeY. M. MarzoukFabrice SchlegelAhmed F. GhoniemPublished in: SIAM J. Sci. Comput. (2009)
Keyphrases
- computational cost
- significant improvement
- iterative algorithms
- computational complexity
- preprocessing
- dynamic programming
- k means
- tree structure
- support vector classification
- convergence analysis
- binary tree
- synthetic and real images
- learning algorithm
- detection algorithm
- np hard
- segmentation algorithm
- search space
- reduce the computational cost
- lower bound
- genetic algorithm
- probabilistic model
- similarity measure
- faster convergence
- objective function
- optimal solution
- synthetic and real datasets
- classification trees
- computational effort
- convergence rate
- expectation maximization
- worst case