Sciweavers

2924 search results - page 532 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICNP
2009
IEEE
13 years 5 months ago
RASPberry: A Stable Reader Activation Scheduling Protocol in Multi-Reader RFID Systems
Abstract--Recent technological advances have motivated largescale deployment of RFID systems. RFID readers are often static and carefully deployed in a planned manner. However, the...
ShaoJie Tang, Jing Yuan, Xiang-Yang Li, Guihai Che...
CMA
2010
183views more  CMA 2010»
13 years 4 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
CADE
2011
Springer
12 years 7 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
MOBIHOC
2008
ACM
14 years 7 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
ICDCN
2009
Springer
14 years 2 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...