459 search results - page 36 / 92 » Computational Complexity of Probabilistic Disambiguation |
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
BMCBI
2007
2007
A high-accuracy consensus map of yeast protein complexes reveals modular nature of gene essentiality
14 years 12 months ago
Background: Identifying all protein complexes in an organism is a major goal of systems biology. In the past 18 months, the results of two genome-scale tandem affinity purificatio...
111
click to vote
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
14 years 11 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
106
click to vote
EDBT
2010
ACM
15 years 6 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...