2079 search results - page 36 / 416 » Universality of random graphs |
113
click to vote
RANDOM
1998
Springer
15 years 6 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
129
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
100
click to vote
ENDM
2007
15 years 1 months ago
2007
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
121
Voted
TREC
2004
15 years 3 months ago
2004
With our participation in TREC2004, we test Terrier, a modular and scalable Information Retrieval framework, in three tracks. For the mixed query task of the Web track, we employ ...
129
click to vote
ALT
2003
Springer
15 years 11 months ago
2003
Springer
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...