Sciweavers

675 search results - page 73 / 135
» On Compression of Parse Trees
Sort
View
ACL
2006
13 years 10 months ago
QuestionBank: Creating a Corpus of Parse-Annotated Questions
This paper describes the development of QuestionBank, a corpus of 4000 parseannotated questions for (i) use in training parsers employed in QA, and (ii) evaluation of question par...
John Judge, Aoife Cahill, Josef van Genabith
ECMDAFA
2008
Springer
166views Hardware» more  ECMDAFA 2008»
13 years 10 months ago
Towards Roundtrip Engineering - A Template-Based Reverse Engineering Approach
Model driven development suggests to make models the main artifact in software development. To get executable models in most cases code generation to a "traditional" prog...
Manuel Bork, Leif Geiger, Christian Schneider, Alb...
ACL
2004
13 years 10 months ago
Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
CAV
2012
Springer
231views Hardware» more  CAV 2012»
11 years 11 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
ICASSP
2011
IEEE
13 years 14 days ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu