2079 search results - page 13 / 416 » Universality of random graphs |
172
click to vote
AML
2010
15 years 7 months ago
2010
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
214
click to vote
ICCS
1994
Springer
15 years 11 months ago
1994
Springer
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
208
click to vote
IJCNN
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
159
click to vote
RSA
2006
15 years 7 months ago
2006
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
183
click to vote
SOFSEM
2009
Springer
16 years 4 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...