Login / Signup
Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem.
Ulrich Betke
Published in:
Discret. Comput. Geom. (2004)
Keyphrases
</>
data structure
machine learning algorithms
optimization problems
learning algorithm
times faster
computational complexity
significant improvement
computational cost
worst case
machine learning
high dimensional
computationally efficient
theoretical analysis
optimization methods
computational geometry
linear space