30 search results - page 4 / 6 » Random half-integral polytopes |
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
STOC
2001
ACM
14 years 6 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
ISSAC
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
JMLR
2012
11 years 8 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
TIT
2008
13 years 5 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...