709 search results - page 15 / 142 » On LR(k)-Parsers of Polynomial Size |
DIS
1998
Springer
15 years 1 months ago
1998
Springer
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
PG
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...
PAMI
2010
14 years 8 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
JSC
2002
14 years 9 months ago
2002
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...