2473 search results - page 216 / 495 » The Logic of Communication Graphs |
143
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
128
click to vote
SENSYS
2005
ACM
15 years 9 months ago
2005
ACM
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
151
click to vote
BIOCOMP
2008
15 years 5 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
150
click to vote
PODC
2012
ACM
13 years 6 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...