Sciweavers

1388 search results - page 81 / 278
» Querying Linguistic Trees
Sort
View
83
Voted
ACL
2004
15 years 2 months ago
Wrapping of Trees
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends TreeAdjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition t...
James Rogers
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 5 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
113
Voted
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
15 years 5 months ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 4 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ALGORITHMICA
2011
14 years 7 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro