Sciweavers

73 search results - page 3 / 15
» Recursion and grammars for CS2
Sort
View
RIA
2006
84views more  RIA 2006»
13 years 5 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
CVPR
2011
IEEE
13 years 2 months ago
Shape Grammar Parsing via Reinforcement Learning
This paper tackles shape grammar parsing for facade segmentation using a novel optimization approach based on reinforcement learning (RL). To this end, we use a binary recursive g...
Olivier Teboul, Iasonas Kokkinos, Panagiotis Kouts...
AI
2009
Springer
13 years 9 months ago
Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
Rahmatullah Hafiz
ACTAC
2005
51views more  ACTAC 2005»
13 years 5 months ago
Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars
Propagating scattered context grammars are used to generate their sentences together with their parses--that is, the sequences of labels denoting productions whose use lead to the ...
Alexander Meduna, Jirí Techet
INFOCOM
2012
IEEE
11 years 7 months ago
FlowSifter: A counting automata approach to layer 7 field extraction for deep flow inspection
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
Chad R. Meiners, Eric Norige, Alex X. Liu, Eric To...