1199 search results - page 90 / 240 » Parameterized Proof Complexity |
IJCV
2000
13 years 9 months ago
2000
Linear parameterized models of optical flow, particularly affine models, have become widespread in image motion analysis. The linear model coefficients are straightforward to estim...
DSL
2009
13 years 7 months ago
2009
Programmers often write custom parsers for the command line input of their programs. They do so, in part, because they believe that both their program's parameterization and t...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...