Sciweavers

914 search results - page 44 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
AINA
2007
IEEE
14 years 2 months ago
Domain Modelling for Ubiquitous Computing Applications
Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely ...
Anthony Harrington, Vinny Cahill
NIPS
2004
13 years 11 months ago
Dynamic Bayesian Networks for Brain-Computer Interfaces
We describe an approach to building brain-computer interfaces (BCI) based on graphical models for probabilistic inference and learning. We show how a dynamic Bayesian network (DBN...
Pradeep Shenoy, Rajesh P. N. Rao
RECOMB
2008
Springer
14 years 10 months ago
A Bayesian Approach to Protein Inference Problem in Shotgun Proteomics
The protein inference problem represents a major challenge in shotgun proteomics. Here we describe a novel Bayesian approach to address this challenge that incorporates the predict...
Yong Fuga Li, Randy J. Arnold, Yixue Li, Predrag R...
ICLP
2009
Springer
14 years 11 months ago
Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
Henning Christiansen, Ole Torp Lassen
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 5 months ago
Are PCPs Inherent in Efficient Arguments?
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
Guy N. Rothblum, Salil P. Vadhan