1466 search results - page 131 / 294 » Complexity of Reasoning over Temporal Data Models |
204
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
165
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
131
click to vote
AMW
2010
15 years 6 months ago
2010
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
202
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
138
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...