Sciweavers

340 search results - page 25 / 68
» ets 2009
Sort
View
QSHINE
2009
IEEE
15 years 6 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
ICRA
2009
IEEE
91views Robotics» more  ICRA 2009»
15 years 6 months ago
Specialization as an optimal strategy under varying external conditions
— We present an investigation of specialization when considering the execution of collaborative tasks by a robot swarm. Specifically, we consider the stick-pulling problem firs...
M. Ani Hsieh, Ádám M. Halász,...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
15 years 6 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
CANS
2009
Springer
126views Cryptology» more  CANS 2009»
15 years 6 months ago
Ensuring Authentication of Digital Information Using Cryptographic Accumulators
In this paper, we study the broadcast authentication problem for both erasure and adversarial networks. Two important concerns for authentication protocols are the authentication ...
Christophe Tartary
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 6 months ago
Are PCPs Inherent in Efficient Arguments?
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
Guy N. Rothblum, Salil P. Vadhan