154 search results - page 26 / 31 » rsa 2006 |
RSA
2008
13 years 8 months ago
2008
ABSTRACT: Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching syste...
RSA
2010
13 years 8 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
RSA
2010
13 years 8 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
RSA
2008
13 years 9 months ago
2008
Let L be chosen uniformly at random from among the latin squares of order n 4 and let r, s be arbitrary distinct rows of L. We study the distribution of r,s, the permutation of t...
RSA
2008
13 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...