5153 search results - page 103 / 1031 » Introduction to Randomized Algorithms |
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.
106
Voted
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
134
click to vote
SLSFS
2005
Springer
15 years 7 months ago
2005
Springer
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
125
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
STOC
1992
ACM
15 years 6 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...