Sciweavers

712 search results - page 65 / 143
» A mixture model for random graphs
Sort
View
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
14 years 4 months ago
Complex network topologies and synchronization
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
Paolo Checco, Mario Biey, Gábor Vattay, Lju...
ICASSP
2007
IEEE
14 years 4 months ago
Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Jue Wu, Albert C. S. Chung
CORR
2007
Springer
146views Education» more  CORR 2007»
13 years 10 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 1 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
ICNP
2005
IEEE
14 years 3 months ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...