5580 search results - page 205 / 1116 » Randomized priority algorithms |
121
Voted
CPC
2007
15 years 2 months ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
JAIR
2007
15 years 2 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
123
click to vote
SODA
2012
ACM
13 years 4 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...
IRI
2008
IEEE
15 years 8 months ago
2008
IEEE
Super-Pages have been wandering around for more than a decade. There are some particular operating systems that support Super-Paging and there are some recent research papers that...
117
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...