59 search results - page 4 / 12 » A distributional study of the path edge-covering numbers for... |
ICNP
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper focuses on understanding the scale and the distribution of “state overhead” (briefly load) that is incurred on the routers by various value-added network services,...
EUROPAR
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. When parallelizing hierarchical view frustum culling and collision detection, the low computation cost per node and the fact that the traversal path through the tree stru...
CIE
2009
Springer
14 years 19 days ago
2009
Springer
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
RSA
2002
13 years 5 months ago
2002
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...