459 search results - page 19 / 92 » Computational Complexity of Probabilistic Disambiguation |
AAAI
1998
15 years 1 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
102
click to vote
GREC
2007
Springer
15 years 3 months ago
2007
Springer
Computer understanding of visual languages in pen-based environments requires a combination of lexical analysis in which the basic tokens are recognized from hand-drawn gestures an...
RECOMB
2008
Springer
16 years 1 days ago
2008
Springer
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...
198
click to vote
ICLP
2009
Springer
16 years 11 days ago
2009
Springer
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...
COCO
2009
Springer
15 years 6 months ago
2009
Springer
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...