Sciweavers

459 search results - page 37 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
JCB
2006
185views more  JCB 2006»
15 years 4 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
ENTCS
2008
146views more  ENTCS 2008»
15 years 4 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
CVPR
2010
IEEE
16 years 15 days ago
Segmentation of Building Facades Using Procedural Shape Priors
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
Olivier Teboul, Loic Simon, Panagiotis Koutsouraki...
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
15 years 8 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara
PERCOM
2010
ACM
15 years 2 months ago
Faster Bayesian context inference by using dynamic value ranges
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
Korbinian Frank, Patrick Robertson, Sergio Fortes ...