Sciweavers

APPT
2007
Springer
14 years 24 days ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
PODC
2010
ACM
14 years 28 days ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
PODC
2010
ACM
14 years 28 days ago
Brief announcement: single-version permissive STM
We present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to anothe...
Hagit Attiya, Eshcar Hillel
PODC
2010
ACM
14 years 28 days 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
14 years 28 days 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
14 years 28 days 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
14 years 28 days 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
14 years 28 days 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...
ESCIENCE
2006
IEEE
14 years 28 days ago
Towards User-Defined Performance Monitoring of Distributed Java Applications
This paper presents a new approach to the issues of performance monitoring and visualization of distributed applications using the J-OCM monitoring system. We are focusing on the ...
Wlodzimierz Funika, Piotr Godowski, Piotr Pegiel, ...