727 search results - page 76 / 146 » A Calculus of Bounded Capacities |
PODC
2012
ACM
11 years 10 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
INFOCOM
2002
IEEE
14 years 20 days ago
2002
IEEE
Abstract— We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach on the assumption that a node can be ab...
ANTS
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...