Sciweavers

1120 search results - page 108 / 224
» Eager Markov Chains
Sort
View
WSC
1998
15 years 7 months ago
Bayesian Model Selection when the Number of Components is Unknown
In simulation modeling and analysis, there are two situations where there is uncertainty about the number of parameters needed to specify a model. The first is in input modeling w...
Russell C. H. Cheng
UAI
1996
15 years 7 months ago
Bayesian Learning of Loglinear Models for Neural Connectivity
This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is t...
Kathryn B. Laskey, Laura Martignon
BMCBI
2007
127views more  BMCBI 2007»
15 years 6 months ago
A Latent Variable Approach for Meta-Analysis of Gene Expression Data from Multiple Microarray Experiments
Background: With the explosion in data generated using microarray technology by different investigators working on similar experiments, it is of interest to combine results across...
Hyungwon Choi, Ronglai Shen, Arul M. Chinnaiyan, D...
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 6 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...
ITA
2006
163views Communications» more  ITA 2006»
15 years 6 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...