709 search results - page 141 / 142 » On LR(k)-Parsers of Polynomial Size |
IPL
2010
13 years 19 days ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
TCSV
2010
13 years 16 days ago
2010
In this paper, we are concerned with the modeling of motion between frames of a video sequence. Typically, it is not possible to represent the motion between frames by a single mod...
ICDE
2011
IEEE
12 years 9 months ago
2011
IEEE
— In many applications involving the multiple criteria optimal decision making, users may often want to make a personal trade-off among all optimal solutions. As a key feature, t...
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
APPROX
2011
Springer
12 years 5 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...