709 search results - page 35 / 142 » On LR(k)-Parsers of Polynomial Size |
AUSAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
CSL
2002
Springer
14 years 9 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
PR
2007
14 years 9 months ago
2007
Recursive procedures used for sequential calculations of polynomial basis coefficients in discrete orthogonal moments produce unreliable results for high moment orders as a resul...
105
click to vote
CRYPTO
2012
Springer
13 years 7 days ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...