580 search results - page 28 / 116 » Choosing a random peer |
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
RSA
2008
14 years 11 months ago
2008
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
STOC
1998
ACM
15 years 4 months ago
1998
ACM
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
: 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...
116
click to vote
CATA
2008
15 years 1 months ago
2008
The diagnosis of cancer type based on microarray data offers hope that cancer classification can be highly accurate for clinicians to choose the most appropriate forms of treatmen...