An Approximation Algorithm for Binary Searching in Trees.
Eduardo Sany LaberMarco MolinaroPublished in: ICALP (1) (2008)
Keyphrases
- computational complexity
- preprocessing
- detection algorithm
- objective function
- k means
- binary tree
- computational cost
- times faster
- expectation maximization
- linear programming
- cost function
- high accuracy
- experimental evaluation
- neural network
- theoretical analysis
- polygonal approximation
- optimization algorithm
- similarity measure
- hamming distance
- input data
- tree edit distance
- closed form
- matching algorithm
- segmentation algorithm
- multi objective
- decision trees