Sciweavers

2321 search results - page 249 / 465
» A Protocol for a Distributed Recommender System
Sort
View
SERSCISA
2009
Springer
15 years 11 months ago
A Kademlia-Based Node Lookup System for Anonymization Networks
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
Benedikt Westermann, Andriy Panchenko, Lexi Pimeni...
133
Voted
NDSS
2009
IEEE
15 years 11 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
151
Voted
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
15 years 11 months ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge
DEXAW
2004
IEEE
166views Database» more  DEXAW 2004»
15 years 8 months ago
Development of Flexible Peer-To-Peer Information Systems Using Adaptable Mobile Agents
Wide-area networks provide an easy access to many different distributed and heterogeneous data sources. The development of automated operating tools is still complex, particularly...
Jean-Paul Arcangeli, Sebastien Leriche, Marc Pante...
WSC
1997
15 years 6 months ago
Java Based Conservative Distributed Simulation
Distributed discrete event simulation techniques aim at an acceleration of the execution of a self-contained simulation model by the spatial decomposition of that model and the co...
Alois Ferscha, Michael Richter