2079 search results - page 129 / 416 » Universality of random graphs |
145
click to vote
RSA
2002
15 years 4 months ago
2002
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
124
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
150
click to vote
USENIX
2007
15 years 7 months ago
2007
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
129
click to vote
RELMICS
2009
Springer
15 years 11 months ago
2009
Springer
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to ...
121
click to vote
IPPS
1993
IEEE
15 years 8 months ago
1993
IEEE
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...