492 search results - page 1 / 99 » The number of possibilities for random dating |
JCT
2008
13 years 4 months ago
2008
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
STOC
2004
ACM
14 years 5 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.
CORR
2011
Springer
12 years 11 months ago
2011
Springer
— The problem of random number generation dates
DATE
2009
IEEE
13 years 11 months ago
2009
IEEE
— Fault injection has become a very classical method to determine the dependability of an integrated system with respect to soft errors. Due to the huge number of possible error ...