388 search results - page 48 / 78 » Robust Lower Bounds for Communication and Stream Computation |
173
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
150
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...
144
click to vote
QEST
2006
IEEE
16 years 3 days ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
177
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
163
click to vote
IH
2005
Springer
15 years 11 months ago
2005
Springer
This paper reports the first use of ID Modulation to embed a bitstream representing sensor information in a standards-compliant Radio Frequency Identification (RFID) channel. Like ...