2079 search results - page 64 / 416 » Universality of random graphs |
126
click to vote
RSA
2011
14 years 11 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
123
click to vote
JCT
2011
14 years 11 months ago
2011
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
133
click to vote
IM
2008
15 years 4 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
127
click to vote
SSPR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Statistical analysis of spatially uniform signal contexts allows Discrete Universal Denoiser (DUDE) to effectively correct signal errors caused by a discrete symmetric me...
147
click to vote
ACNS
2004
Springer
15 years 7 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...