709 search results - page 5 / 142 » On LR(k)-Parsers of Polynomial Size |
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
84
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
TCOM
2008
14 years 9 months ago
2008
The step size leading to the absolute minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a...
IPL
2008
14 years 9 months ago
2008
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...