A New Approximation Algorithm for Bend Minimization in the Kandinsky Model.
Wilhelm BarthPetra MutzelCanan YildizPublished in: Graph Drawing (2006)
Keyphrases
- objective function
- mathematical model
- probabilistic model
- algorithm employs
- recognition algorithm
- theoretical analysis
- closed form
- parameter estimation
- cost function
- optimization algorithm
- final result
- expectation maximization
- selection algorithm
- preprocessing
- optimal solution
- simulated annealing
- input data
- optimization model
- estimation algorithm
- learning algorithm
- kalman filter
- k means
- em algorithm
- error function
- energy function
- approximation methods
- error bounds
- monte carlo
- tree structure
- detection algorithm
- segmentation algorithm
- computational cost
- dynamic programming
- np hard
- bayesian framework
- convergence rate
- pointwise
- model free
- particle swarm optimization
- linear approximation
- global minimization