709 search results - page 25 / 142 » On LR(k)-Parsers of Polynomial Size |
JMLR
2002
14 years 9 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
COMBINATORICS
2006
14 years 9 months ago
2006
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...