Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope.
Yulai XieJack SnoeyinkJinhui XuPublished in: SCG (2006)
Keyphrases
- high dimensional
- preprocessing
- dynamic programming
- high efficiency
- experimental evaluation
- single pass
- bayesian networks
- high accuracy
- learning algorithm
- computational complexity
- np hard
- noisy data
- convex hull
- matching algorithm
- detection algorithm
- simulated annealing
- cost function
- computationally efficient
- segmentation algorithm
- computational cost
- significant improvement
- convergence rate
- objective function
- linear programming
- optimal solution