501 search results - page 92 / 101 » Communication Lower Bounds Using Dual Polynomials |
ICCCN
2007
IEEE
13 years 9 months ago
2007
IEEE
—Geographic face routing provides an attractive way for packet delivery in wireless networks due to its high reliability and low overhead. A good face routing protocol should pro...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...