712 search results - page 14 / 143 » A mixture model for random graphs |
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
JCT
2007
13 years 10 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
GFKL
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
TSP
2010
13 years 5 months ago
2010
In this paper, we propose the complex Gaussian scale mixture (CGSM) to model the complex wavelet coefficients as an extension of the Gaussian scale mixture (GSM), which is for real...