An Optimal Algorithm for the Indirect Covering Subtree Problem
Joachim SpoerhasePublished in: CoRR (2010)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- high accuracy
- globally optimal
- times faster
- worst case
- experimental evaluation
- improved algorithm
- theoretical analysis
- computational cost
- np hard
- search space
- computational complexity
- piecewise linear
- path planning
- locally optimal
- operating point
- detection algorithm
- optimization algorithm
- probabilistic model
- expectation maximization
- linear programming
- markov random field
- data sets
- multi objective
- preprocessing
- data structure
- objective function
- similarity measure
- neural network