91 search results - page 4 / 19 » On the Polynomial Transparency of Resolution |
CRV
2008
IEEE
14 years 2 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
AAAI
2004
13 years 9 months ago
2004
We have recently proposed augmenting clauses in a Boolean database with groups of permutations, the augmented clauses then standing for the set of all clauses constructed by actin...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
Recently, new sampling schemes were presented for signals with finite rate of innovation (FRI) using sampling kernels reproducing polynomials or exponentials [1] [2]. In this pape...
TAMC
2010
Springer
14 years 22 days ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...