492 search results - page 22 / 99 » The number of possibilities for random dating |
CN
2010
13 years 5 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
SPAA
2010
ACM
13 years 8 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
TKDE
2002
13 years 8 months ago
2002
Our goal with this paper is to contribute a common theoretical framework for studying the performance of disk-storage devices. Understanding the performance behavior of these devi...
DKE
2007
13 years 8 months ago
2007
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
CRYPTO
2004
Springer
14 years 2 months ago
2004
Springer
A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Inte...