Sciweavers

417 search results - page 80 / 84
» Orderings for Innermost Termination
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
AIML
2008
13 years 9 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake
LREC
2010
160views Education» more  LREC 2010»
13 years 9 months ago
FrAG, a Hybrid Constraint Grammar Parser for French
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
Eckhard Bick
WICON
2008
13 years 9 months ago
The effect of cooperation at the network protocol level
Abstract--There has been a great deal of attention on cooperative communication which exploits the spatial diversity among antennas belonging to multiple terminals. Most of the exi...
Beiyu Rong, Anthony Ephremides
EACL
2006
ACL Anthology
13 years 9 months ago
Inheritance and the CCG Lexicon
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
Mark McConville