1139 search results - page 109 / 228 » Bounded Ideation Theory |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider data networks in which real-time/near real-time applications require not only successful transmission of packets from source to destination, but also specific end-to...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
ISW
2009
Springer
14 years 2 months ago
2009
Springer
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...