3134 search results - page 47 / 627 » Computing full disjunctions |
CIE
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to t...
RT
2000
Springer
14 years 1 months ago
2000
Springer
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
KDD
1999
ACM
14 years 2 months ago
1999
ACM
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
KI
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...