3368 search results - page 349 / 674 » The Complexity of Query Reliability |
140
click to vote
CGF
2000
15 years 6 months ago
2000
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...
203
click to vote
TLSDKCS
2010
15 years 1 months ago
2010
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
204
click to vote
AAAI
2012
13 years 9 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
165
click to vote
PODS
2002
ACM
16 years 6 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
177
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...