Sciweavers

777 search results - page 59 / 156
» Optimization of Relational Preference Queries
Sort
View
EMNLP
2006
13 years 11 months ago
Inducing Temporal Graphs
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
Philip Bramsen, Pawan Deshpande, Yoong Keok Lee, R...
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 10 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
AIR
2006
124views more  AIR 2006»
13 years 10 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
DOCENG
2004
ACM
14 years 3 months ago
Querying XML documents by dynamic shredding
With the wide adoption of XML as a standard data representation and exchange format, querying XML documents becomes increasingly important. However, relational database systems co...
Hui Zhang 0003, Frank Wm. Tompa
AIMSA
2006
Springer
14 years 1 months ago
Machine Learning for Spoken Dialogue Management: An Experiment with Speech-Based Database Querying
Although speech and language processing techniques achieved a relative maturity during the last decade, designing a spoken dialogue system is still a tailoring task because of the ...
Olivier Pietquin