Sciweavers

PODC
2010
ACM
13 years 6 months ago
Distributed data classification in sensor networks
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
Ittay Eyal, Idit Keidar, Raphael Rom
PODC
2010
ACM
13 years 6 months ago
Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...
Bo Tan, Laurent Massoulié
PODC
2010
ACM
13 years 6 months ago
Brief announcement: revisiting the power-law degree distribution for social graph analysis
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
Alessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrin...
PODC
2010
ACM
13 years 6 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
PODC
2010
ACM
13 years 6 months ago
On the computational power of oblivious robots: forming a series of geometric patterns
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...
Shantanu Das, Paola Flocchini, Nicola Santoro, Mas...
PODC
2010
ACM
13 years 8 months ago
Broadcasting in unreliable radio networks
Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Ro...
PODC
2010
ACM
13 years 8 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
PODC
2010
ACM
13 years 8 months ago
Brief announcement: on the quest of optimal service ordering in decentralized queries
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
Efthymia Tsamoura, Anastasios Gounaris, Yannis Man...
PODC
2010
ACM
13 years 8 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
PODC
2010
ACM
13 years 8 months ago
Brief announcement: on enhancing concurrency in distributed transactional memory
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
Bo Zhang, Binoy Ravindran