34 search results - page 4 / 7 » Random inscribing polytopes |
IPCO
2004
13 years 8 months ago
2004
Let P be a random 0/1-polytope in d with n(d) vertices, and denote by k(P) the k-face density of P, i.e., the quotient of the number of k-dimensional faces of P and `n(d) k+1
STOC
2009
ACM
14 years 8 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
13 years 2 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
14 years 1 months ago
2007
Springer
STOC
2006
ACM
14 years 7 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 ...