Sciweavers

37 search results - page 1 / 8
» Low Memory Distributed Protocols for 2-Coloring
Sort
View
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
13 years 3 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
ICNP
2009
IEEE
13 years 2 months ago
Memory Efficient Protocols for Detecting Node Replication Attacks in Wireless Sensor Networks
Sensor networks deployed in hostile areas are subject to node replication attacks, in which an adversary compromises a few sensors, extracts the security keys, and clones them in a...
Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelia...
PET
2012
Springer
11 years 7 months ago
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams
We consider applications scenarios where an untrusted aggregator wishes to continually monitor the heavy-hitters across a set of distributed streams. Since each stream can contain ...
T.-H. Hubert Chan, Mingfei Li, Elaine Shi, Wenchan...
ICDCS
1998
IEEE
13 years 9 months ago
Low-Overhead Protocols for Fault-Tolerant File Sharing
In this paper, we quantify the adverse effect of file sharing on the performance of reliable distributed applications. We demonstrate that file sharing incurs significant overhead...
Lorenzo Alvisi, Sriram Rao, Harrick M. Vin
ASPLOS
1996
ACM
13 years 9 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...