Sciweavers

50 search results - page 10 / 10
» When Does Opportunistic Routing Make Sense
Sort
View
EDCC
2010
Springer
13 years 9 months ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 6 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
TPDS
2010
93views more  TPDS 2010»
13 years 3 months ago
Self-Consistent MPI Performance Guidelines
Message passing using the Message Passing Interface (MPI) is at present the most widely adopted framework for programming parallel applications for distributed-memory and clustere...
Jesper Larsson Träff, William D. Gropp, Rajee...
CANS
2010
Springer
150views Cryptology» more  CANS 2010»
13 years 2 months ago
Predicate Encryption with Partial Public Keys
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano
MDM
2010
Springer
188views Communications» more  MDM 2010»
13 years 3 months ago
A Distributed Technique for Dynamic Operator Placement in Wireless Sensor Networks
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Georgios Chatzimilioudis, Nikos Mamoulis, Dimitrio...