Sciweavers

13180 search results - page 2275 / 2636
» Network Models
Sort
View
CSFW
2009
IEEE
15 years 11 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
LOCWEB
2009
ACM
15 years 11 months ago
Binding privacy rules to location on the web
As a tool for mitigating the potential privacy risks of gathering and transmitting location information on the Web, we suggest in this paper a model for conveying location informa...
Alissa Cooper, John Morris
FOCS
2008
IEEE
15 years 11 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
BIRTHDAY
2004
Springer
15 years 10 months ago
Communicating Mobile Processes
This paper presents a new model for mobile processes in occam-π. A process, embedded anywhere in a dynamically evolving network, may suspend itself mid-execution, be safely discon...
Peter H. Welch, Fred R. M. Barnes
PADS
1998
ACM
15 years 9 months ago
Optimizing Communication in Time-Warp Simulators
In message passing environments, the message send time is dominated by overheads that are relatively independent of the message size. Therefore, fine-grained applications (such a...
Malolan Chetlur, Nael B. Abu-Ghazaleh, Radharamana...
« Prev « First page 2275 / 2636 Last » Next »