750 search results - page 44 / 150 » Reconstruction for Models on Random Graphs |
OPODIS
2008
15 years 1 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
132
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
106
click to vote
SIGMETRICS
2003
ACM
15 years 5 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...