459 search results - page 2 / 92 » Computational Complexity of Probabilistic Disambiguation |
CORR
1998
Springer
13 years 5 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
COCO
1998
Springer
13 years 9 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
NAACL
2010
13 years 3 months ago
2010
This paper contributes a formalization of frame-semantic parsing as a structure prediction problem and describes an implemented parser that transforms an English sentence into a f...
ACL
1992
13 years 6 months ago
1992
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...