Sciweavers

5866 search results - page 1152 / 1174
» Designing Accelerator-Based Distributed Systems for High Per...
Sort
View
EUROCRYPT
1990
Springer
15 years 1 months ago
Experimental Quantum Cryptography
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a ran...
Charles H. Bennett, François Bessette, Gill...
CONEXT
2009
ACM
14 years 11 months ago
Traffic management and resource allocation in small wired/wireless networks
We consider the problem of traffic management in small networks with both wireless and wired devices, connected to the Internet through a single gateway. Examples of such networks...
Christos Gkantsidis, Thomas Karagiannis, Peter B. ...
MAGS
2008
104views more  MAGS 2008»
14 years 9 months ago
Retractable contract network for empowerment in workforce scheduling
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...
Edward P. K. Tsang, Timothy Gosling, Botond Virgin...
JSAC
2006
181views more  JSAC 2006»
14 years 9 months ago
Information theoretic framework of trust modeling and evaluation for ad hoc networks
Abstract-- The performance of ad hoc networks depends on cooperation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustwor...
Yan Lindsay Sun, Wei Yu, Zhu Han, K. J. Ray Liu
WWW
2011
ACM
14 years 4 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
« Prev « First page 1152 / 1174 Last » Next »