Sciweavers

34 search results - page 2 / 7
» Random inscribing polytopes
Sort
View
ORL
2011
12 years 8 months ago
Random half-integral polytopes
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
Gábor Braun, Sebastian Pokutta
DCG
2007
94views more  DCG 2007»
13 years 5 months ago
Banach-Mazur Distances and Projections on Random Subgaussian Polytopes
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetri...
Rafal Latala, Piotr Mankiewicz, Krzysztof Oleszkie...
GD
2006
Springer
13 years 9 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
13 years 6 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
JMLR
2012
11 years 7 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
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...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint