278 search results - page 3 / 56 » Variants of Spreading Messages |
GLOBECOM
2006
IEEE
13 years 12 months ago
2006
IEEE
— This paper presents a complete solution to the problem of how to parametrise cluster-based stochastic MIMO channel models from measurement data, with minimum user intervention....
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
IPL
2010
13 years 4 months ago
2010
In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash functio...
SPAA
2010
ACM
13 years 6 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...
CTRSA
2007
Springer
13 years 12 months ago
2007
Springer
FORK-256 is a hash function presented at FSE 2006. Whereas SHA-like designs process messages in one stream, FORK-256 uses four parallel streams for hashing. In this article, we pre...