745 search results - page 12 / 149 » On Generating Random Network Structures: Connected Graphs |
95
Voted
JSAC
2007
15 years 9 days ago
2007
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
123
click to vote
WAW
2007
Springer
15 years 6 months ago
2007
Springer
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
94
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
113
click to vote
DAGM
2008
Springer
15 years 2 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
105
click to vote
ICCSA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered...