Sciweavers

197 search results - page 22 / 40
» Answering complex questions with random walk models
Sort
View
96
Voted
SAC
2008
ACM
14 years 8 months ago
Data sharing vs. message passing: synergy or incompatibility?: an implementation-driven case study
One reasonable categorization of coordination models is into data sharing or message passing, based on whether the information necessary to coordination is persistently stored and...
Matteo Ceriotti, Amy L. Murphy, Gian Pietro Picco
ASIACRYPT
2009
Springer
15 years 4 months ago
Cascade Encryption Revisited
Abstract. The security of cascade blockcipher encryption is an important and well-studied problem in theoretical cryptography with practical implications. It is well-known that dou...
Peter Gazi, Ueli M. Maurer
102
Voted
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CC
2007
Springer
108views System Software» more  CC 2007»
14 years 9 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
ICNS
2009
IEEE
15 years 4 months ago
Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
Cédric Gaël Aboue-Nze, Fréd&eac...