3257 search results - page 5 / 652 » Some Results on Effective Randomness |
APPROX
2004
Springer
14 years 28 days ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
INTERACT
2003
13 years 9 months ago
2003
: Most online help systems on the market prove unsuited to the actual needs of novice users. Although recent research has focused on the design and implementation of contextual, ad...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
APPROX
2004
Springer
14 years 28 days ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...