2079 search results - page 221 / 416 » Universality of random graphs |
198
click to vote
SCCC
2002
IEEE
15 years 11 months ago
2002
IEEE
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function from keys to buckets would gi...
124
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and...
157
click to vote
WEBI
2001
Springer
15 years 11 months ago
2001
Springer
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
169
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
168
click to vote
RSA
2002
15 years 6 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...