1591 search results - page 266 / 319 » Random lifts of graphs |
202
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
153
click to vote
IACR
2011
14 years 3 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
142
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
125
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Social media sharing web sites like Flickr allow users to annotate images with free tags, which significantly facilitate Web image search and organization. However, the tags assoc...
135
click to vote
DSN
2009
IEEE
15 years 10 months ago
2009
IEEE
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...