Sciweavers

303 search results - page 29 / 61
» Analyzing Leadership Dynamics in Distributed Group Communica...
Sort
View
IJCAI
2007
13 years 9 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
MUM
2005
ACM
138views Multimedia» more  MUM 2005»
14 years 1 months ago
Group-based content push with dynamic session startup
This paper proposes an intelligent mobile middleware utilizing group-based content push with dynamic session startup and plugand-play features. Solution enhances the distribution ...
Otso Kassinen, Timo Koskela, Erkki Harjula, Jussi ...
ICNP
2000
IEEE
14 years 1 days ago
An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees
We study group loss probabilities of Forward Error Correction (FEC) codes in shared loss multicast communication. We present a new analysis model with explicit state equations usi...
Marc Mosko, J. J. Garcia-Luna-Aceves
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
SPAA
2004
ACM
14 years 1 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...