Sciweavers

1763 search results - page 1 / 353
» Dependent random choice
Sort
View
RSA
2011
102views more  RSA 2011»
13 years 1 months ago
Dependent random choice
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
Jacob Fox, Benny Sudakov
SIAMDM
2008
118views more  SIAMDM 2008»
13 years 6 months ago
Ramsey-Type Problem for an Almost Monochromatic K4
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
Jacob Fox, Benny Sudakov
APPROX
2010
Springer
146views Algorithms» more  APPROX 2010»
13 years 8 months ago
Delaying Satisfiability for Random 2SAT
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
Alistair Sinclair, Dan Vilenchik
NIPS
2007
13 years 8 months ago
Kernel Measures of Conditional Dependence
We propose a new measure of conditional dependence of random variables, based on normalized cross-covariance operators on reproducing kernel Hilbert spaces. Unlike previous kernel...
Kenji Fukumizu, Arthur Gretton, Xiaohai Sun, Bernh...
COLT
2007
Springer
14 years 1 months ago
Observational Learning in Random Networks
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
Julian Lorenz, Martin Marciniszyn, Angelika Steger