709 search results - page 29 / 142 » On LR(k)-Parsers of Polynomial Size |
166
click to vote
ICCV
2007
IEEE
16 years 13 days ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
166
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
155
click to vote
MOC
2000
15 years 5 months ago
2000
Two new families of Reissner-Mindlin triangular finite elements are analyzed. One family, generalizing an element proposed by Zienkiewicz and Lefebvre, approximates (for k 1) the ...
131
click to vote
IPL
2008
15 years 6 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
163
click to vote
JSAT
2010
15 years 27 days ago
2010
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...