Sciweavers

11565 search results - page 2268 / 2313
» Computing Minimal Mappings
Sort
View
SENSYS
2004
ACM
14 years 1 months ago
Versatile low power media access for wireless sensor networks
We propose B-MAC, a carrier sense media access protocol for wireless sensor networks that provides a flexible interface to obtain ultra low power operation, effective collision a...
Joseph Polastre, Jason L. Hill, David E. Culler
ADHOCNOW
2004
Springer
14 years 1 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
CONCUR
2004
Springer
14 years 1 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
« Prev « First page 2268 / 2313 Last » Next »