Sciweavers

2475 search results - page 134 / 495
» On the accuracy of language trees
Sort
View
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
15 years 11 months ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
ACL
2001
15 years 7 months ago
Generating with a Grammar Based on Tree Descriptions: a Constraint-Based Approach
While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures o...
Claire Gardent, Stefan Thater
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 9 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
16 years 7 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
ECOOP
2004
Springer
15 years 11 months ago
Rewritable Reference Attributed Grammars
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...
Torbjörn Ekman, Görel Hedin