Sciweavers

Share
RSA
2008
80views more  RSA 2008»
9 years 2 months ago
The persistent-access-caching algorithm
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...
Predrag R. Jelenkovic, Ana Radovanovic
RSA
2008
69views more  RSA 2008»
9 years 3 months ago
Local resilience of graphs
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
Benny Sudakov, Van H. Vu
RSA
2008
94views more  RSA 2008»
9 years 3 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
RSA
2008
65views more  RSA 2008»
9 years 3 months ago
Eigenvalues of Euclidean random matrices
Charles Bordenave
RSA
2008
94views more  RSA 2008»
9 years 3 months ago
The cycle structure of two rows in a random Latin square
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...
Nicholas J. Cavenagh, Catherine S. Greenhill, Ian ...
RSA
2008
87views more  RSA 2008»
9 years 3 months ago
A combinatorial approach to jumping particles: The parallel TASEP
In this paper we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric exclusion process or TASE...
Enrica Duchi, Gilles Schaeffer
RSA
2008
69views more  RSA 2008»
9 years 3 months ago
On variants of the Johnson-Lindenstrauss lemma
: The Johnson
Jirí Matousek
RSA
2008
103views more  RSA 2008»
9 years 3 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
RSA
2008
80views more  RSA 2008»
9 years 3 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
books