1199 search results - page 149 / 240 » Parameterized Proof Complexity |
EACL
2003
ACL Anthology
13 years 10 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...
UAI
2004
13 years 10 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...
KI
2006
Springer
13 years 8 months 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...
CORR
2004
Springer
13 years 8 months 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
13 years 7 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...