Sciweavers

415 search results - page 35 / 83
» Tree Unification Grammar
Sort
View
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
14 years 3 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
ACL
2010
13 years 6 months ago
Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution grammar (STSG) for monolingual translation tasks such as sentence compression a...
Elif Yamangil, Stuart M. Shieber
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 8 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
14 years 21 days ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
CSCLP
2006
Springer
14 years 11 days ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...