Sciweavers

598 search results - page 77 / 120
» A random graph model for massive graphs
Sort
View
JSAC
1998
126views more  JSAC 1998»
14 years 11 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
RANDOM
1998
Springer
15 years 4 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
ATAL
2007
Springer
15 years 6 months ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima
CSB
2002
IEEE
169views Bioinformatics» more  CSB 2002»
15 years 4 months ago
Bayesian Network and Nonparametric Heteroscedastic Regression for Nonlinear Modeling of Genetic Network
We propose a new statistical method for constructing a genetic network from microarray gene expression data by using a Bayesian network. An essential point of Bayesian network con...
Seiya Imoto, SunYong Kim, Takao Goto, Sachiyo Abur...
MOBICOM
2004
ACM
15 years 5 months ago
Analyzing the spread of active worms over VANET
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...
Syed A. Khayam, Hayder Radha