Sciweavers

1538 search results - page 264 / 308
» Relative Randomness and Cardinality
Sort
View
JPDC
2011
155views more  JPDC 2011»
14 years 18 days ago
A cellular learning automata-based deployment strategy for mobile wireless sensor networks
: One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown ne...
Mehdi Esnaashari, Mohammad Reza Meybodi
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev
OSDI
2004
ACM
15 years 10 months ago
Improving the Reliability of Internet Paths with One-hop Source Routing
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
P. Krishna Gummadi, Harsha V. Madhyastha, Steven D...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
15 years 7 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
ISPA
2005
Springer
15 years 3 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang