Sciweavers

1742 search results - page 139 / 349
» A Framework for Network Modeling in Prolog
Sort
View
UAI
2004
15 years 5 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
Mathias Drton, Thomas S. Richardson
ICASSP
2010
IEEE
15 years 4 months ago
Adaptive compressed sensing - A new class of self-organizing coding models for neuroscience
Sparse coding networks, which utilize unsupervised learning to maximize coding efficiency, have successfully reproduced response properties found in primary visual cortex [1]. Ho...
William K. Coulter, Cristopher J. Hillar, Guy Isle...
153
Voted
JSAC
1998
126views more  JSAC 1998»
15 years 4 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
ENTCS
2007
190views more  ENTCS 2007»
15 years 4 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
IJON
2007
81views more  IJON 2007»
15 years 4 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter