Decomposable trees: a polynomial algorithm fortripodes.
Dominique BarthOlivier BaudonJoël PuechPublished in: Discret. Appl. Math. (2002)
Keyphrases
- detection algorithm
- high accuracy
- computational cost
- worst case
- preprocessing
- dynamic programming
- significant improvement
- times faster
- segmentation algorithm
- np hard
- computational complexity
- improved algorithm
- objective function
- learning algorithm
- convergence rate
- recognition algorithm
- matching algorithm
- clustering method
- polynomially bounded
- expectation maximization
- cost function
- k means
- search space
- optimal solution
- theoretical analysis
- particle swarm optimization
- maximum likelihood
- simulated annealing
- tree construction
- neural network