Sciweavers

993 search results - page 115 / 199
» The Complexity of Probabilistic EL
Sort
View
NIPS
2000
13 years 9 months ago
Discovering Hidden Variables: A Structure-Based Approach
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...
Gal Elidan, Noam Lotner, Nir Friedman, Daphne Koll...
BIODATAMINING
2008
85views more  BIODATAMINING 2008»
13 years 8 months ago
A review of estimation of distribution algorithms in bioinformatics
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...
Rubén Armañanzas, Iñaki Inza,...
FTML
2008
185views more  FTML 2008»
13 years 8 months ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan
IANDC
2006
117views more  IANDC 2006»
13 years 8 months ago
A modular approach to defining and characterising notions of simulation
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
Corina Cîrstea
JAIR
2008
107views more  JAIR 2008»
13 years 8 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld