709 search results - page 10 / 142 » On LR(k)-Parsers of Polynomial Size |
JCT
2008
14 years 9 months ago
2008
We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled beh...
MOC
2002
14 years 9 months ago
2002
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
ORL
2010
14 years 8 months ago
2010
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for a...
DATE
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...