709 search results - page 71 / 142 » On LR(k)-Parsers of Polynomial Size |
COLT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
AUIC
2006
IEEE
15 years 4 months ago
2006
IEEE
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...
103
click to vote
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...