2079 search results - page 218 / 416 » Universality of random graphs |
183
click to vote
CORR
2011
Springer
15 years 29 days ago
2011
Springer
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
138
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
151
click to vote
SIGMETRICS
2005
ACM
16 years 4 days ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
180
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
154
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...