30 search results - page 3 / 6 » Random half-integral polytopes |
STOC
2009
ACM
14 years 5 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
TIT
2010
12 years 12 months ago
2010
In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n >...
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
EJC
2007
13 years 5 months ago
2007
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...