Sciweavers

877 search results - page 14 / 176
» How to Cover a Grammar
Sort
View
CHI
2003
ACM
14 years 7 months ago
Looks good to me
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'...
Linda Roberts, Leigh Rankin, Edward A. Silver, Dar...
ENTCS
2006
184views more  ENTCS 2006»
13 years 7 months ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
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...
Tom Ridge
ESORICS
2007
Springer
13 years 11 months ago
Countering Statistical Disclosure with Receiver-Bound Cover Traffic
Anonymous communications provides an important privacy service by keeping passive eavesdroppers from linking communicating parties. However, using long-term statistical analysis of...
Nayantara Mallesh, Matthew Wright
ICALP
2005
Springer
14 years 27 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
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 ...
Allan Borodin, David Cashman, Avner Magen