An Extension to Trees of the Sardinas and Patterson Algorithm.
Paul Franchi-ZannettacciPublished in: Inf. Process. Lett. (1982)
Keyphrases
- computationally efficient
- dynamic programming
- computational complexity
- improved algorithm
- learning algorithm
- objective function
- detection algorithm
- worst case
- experimental evaluation
- preprocessing
- cost function
- np hard
- matching algorithm
- optimization algorithm
- path planning
- machine learning
- convergence rate
- expectation maximization
- k means
- optimal solution
- data sets
- input data
- high accuracy
- probabilistic model
- theoretical analysis
- computational cost
- significant improvement
- classification algorithm
- times faster
- decision trees
- recognition algorithm