6028 search results - page 199 / 1206 » Randomness as a resource for design |
198
click to vote
MOBICOM
2003
ACM
15 years 12 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
179
click to vote
CHES
1999
Springer
15 years 11 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
193
click to vote
CSREASAM
2003
15 years 8 months ago
2003
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
172
click to vote
USITS
2003
15 years 8 months ago
2003
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
168
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...