Sciweavers

58 search results - page 11 / 12
» How to Round Any CSP
Sort
View
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 4 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
SSS
2007
Springer
121views Control Systems» more  SSS 2007»
14 years 3 months ago
Byzantine Self-stabilizing Pulse in a Bounded-Delay Model
Abstract. “Pulse Synchronization” intends to invoke a recurring distributed event at the different nodes, of a distributed system as simultaneously as possible and with a freq...
Danny Dolev, Ezra N. Hoch
PODC
2004
ACM
14 years 3 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 11 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003
IJDSN
2006
114views more  IJDSN 2006»
13 years 9 months ago
The Sleep Deprivation Attack in Sensor Networks: Analysis and Methods of Defense
The ability of sensor nodes to enter a low power sleep mode is very useful for extending network longevity. We show how adversary nodes can exploit clustering algorithms to ensure ...
Matthew Pirretti, Sencun Zhu, Narayanan Vijaykrish...