2 search results - page 1 / 1 » Randomness buys depth for approximate counting |
ECCC
2010
13 years 3 months ago
2010
AINA
2007
IEEE
13 years 11 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...