877 search results - page 14 / 176 » How to Cover a Grammar |
65
Voted
CHI
2003
ACM
16 years 24 days ago
2003
ACM
The evaluation of grammar inference systems is clearly a non-trivial task, as it is possible to have more than one correct grammar for a given language. The `looks good to me'...
ENTCS
2006
15 years 14 days ago
2006
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
166
click to vote
CPP
2011
14 years 8 days ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
93
Voted
ESORICS
2007
Springer
15 years 4 months ago
2007
Springer
Anonymous communications provides an important privacy service by keeping passive eavesdroppers from linking communicating parties. However, using long-term statistical analysis of...
92
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...