We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
We present a statistical generative model for unsupervised learning of verb argument structures. The model was used to automatically induce the argument structures for the 1,500 mo...
Thiago Alexandre Salgueiro Pardo, Daniel Marcu, Ma...
Query performance issues over semi-structured data have led to the emergence of materialised XML views as a means of restricting the data structure processed by a query. However p...
Today’s argumentation software mostly emphasizes the logical structure of reasoning, and especially the structure as it can be represented in boxes-andarrows style diagrams. In t...
: Two main problems arise in modelling data warehouse structures. The first consists in establishing an adequate representation of dimensions in order to facilitate and to control ...