Sciweavers

34 search results - page 5 / 7
» Random inscribing polytopes
Sort
View
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 7 months ago
Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
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...
Roman Vershynin
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 7 months ago
One line and n points
: 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...
Bernd Gärtner, József Solymosi, Falk T...
ISSAC
2004
Springer
106views Mathematics» more  ISSAC 2004»
14 years 22 days ago
Factoring polynomials via polytopes
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
CVPR
2012
IEEE
11 years 9 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
TIT
2008
122views more  TIT 2008»
13 years 7 months ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
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 ...
Michael Chertkov, Mikhail G. Stepanov