2735 search results - page 352 / 547 » Comparing notions of randomness |
84
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
109
Voted
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
108
click to vote
NOSSDAV
2009
Springer
15 years 7 months ago
2009
Springer
In Swarm-based Peer-to-Peer Streaming (SPS) mechanisms, participating peers form a randomly connected mesh over which they incorporate swarm-like content delivery. In practice, a ...
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
SIGMETRICS
2006
ACM
15 years 6 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...