1511 search results - page 47 / 303 » Randomness, lowness and degrees |
SODA
2012
ACM
13 years 2 months ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
100
click to vote
COCO
2007
Springer
15 years 6 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
124
click to vote
JMLR
2012
13 years 2 months ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
STACS
2004
Springer
15 years 5 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
112
click to vote
DAM
2008
14 years 11 months ago
2008
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...