A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed.
Alexander I. BarvinokPublished in: Math. Oper. Res. (1994)
Keyphrases
- computational complexity
- high accuracy
- strongly polynomial
- convex hull
- preprocessing
- special case
- cost function
- worst case
- k means
- dynamic programming
- experimental evaluation
- fixed size
- matching algorithm
- detection algorithm
- expectation maximization
- search space
- approximation ratio
- similarity measure
- optimization algorithm
- segmentation algorithm
- linear programming
- simulated annealing
- computational cost
- neural network
- probabilistic model
- convergence rate
- linear systems
- dimensional data
- significant improvement
- min cost
- learning algorithm