A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees.
Evgeny DantsinAndrei VoronkovPublished in: FoSSaCS (1999)
Keyphrases
- high accuracy
- learning algorithm
- experimental evaluation
- computational complexity
- times faster
- optimization algorithm
- tree structure
- dynamic programming
- simulated annealing
- linear programming
- detection algorithm
- search space
- k means
- preprocessing
- computational cost
- improved algorithm
- objective function
- similarity measure
- binary trees
- matching algorithm
- convex hull
- segmentation algorithm
- theoretical analysis
- expectation maximization
- worst case
- np hard
- cost function
- search algorithm
- data structure
- optimal solution