2 search results - page 1 / 1 » Randomness buys depth for approximate counting |
65
Voted
ECCC
2010
14 years 11 months ago
2010
118
click to vote
AINA
2007
IEEE
15 years 7 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...