Sciweavers

4411 search results - page 38 / 883
» Communication Complexity and Its Applications
Sort
View
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
12 years 9 days ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
GLOBECOM
2006
IEEE
14 years 4 months ago
Application of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Abstract— In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and...
Ronghui Peng, Rong-Rong Chen
EJC
2000
13 years 11 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
DEBS
2010
ACM
14 years 1 months ago
Reliable complex event detection for pervasive computing
Complex event processing for pervasive computing must deal with various sources of error. In this paper, we focus on improving complex event detector handling of several types of ...
Dan O'Keeffe, Jean Bacon
DNIS
2005
Springer
112views Database» more  DNIS 2005»
14 years 3 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani