Sciweavers

19798 search results - page 435 / 3960
» Is Structural Subtyping Useful
Sort
View
PODC
2010
ACM
15 years 7 months ago
Brief announcement: tree decomposition for faster concurrent data structures
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 ...
Johannes Schneider, Roger Wattenhofer
CICLING
2006
Springer
15 years 7 months ago
Unsupervised Learning of Verb Argument Structures
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...
BNCOD
2007
151views Database» more  BNCOD 2007»
15 years 5 months ago
Compressed Materialised Views of Semi-Structured Data
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...
Richard Gourlay, Brian Tripney, John N. Wilson
145
Voted
JURIX
2007
15 years 5 months ago
Beyond boxes and arrows: argumentation support in terms of the knowledge structure of a legal topic
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...
Maaike Schweers, Bart Verheij
DMDW
2003
120views Management» more  DMDW 2003»
15 years 5 months ago
Well-formed data warehouse structures
: 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 ...
Michel Schneider