1199 search results - page 149 / 240 » Parameterized Proof Complexity |
110
click to vote
EACL
2003
ACL Anthology
15 years 2 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
89
Voted
UAI
2004
15 years 2 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
91
Voted
KI
2006
Springer
15 years 21 days ago
2006
Springer
We present DiaWOz-II, a configurable software environment for Wizard-of-Oz studies in mathematics and engineering. Its interface is based on a structural wysiwyg editor which allow...
106
click to vote
CORR
2004
Springer
15 years 17 days ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
PERCOM
2010
ACM
14 years 11 months ago
2010
ACM
—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...