1957 search results - page 345 / 392 » Approximate algorithms for neural-Bayesian approaches |
UAI
2000
14 years 11 months ago
2000
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
JCO
2010
14 years 8 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...