597 search results - page 14 / 120 » Homomorphisms of random paths |
122
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
Random beamforming, where each node selects a main beam direction without any coordination with other nodes, has been proposed as a simple technique to improve connectivity in wire...
FTDCS
2004
IEEE
15 years 1 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
ALGORITHMICA
2010
14 years 9 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
102
click to vote
RSA
2010
14 years 8 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...