552 search results - page 51 / 111 » On the Complexity of Join Predicates |
111
Voted
ASE
2004
15 years 12 days ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
87
Voted
GI
2009
Springer
14 years 10 months ago
2009
Springer
: An operational Air Surveillance System shall generate a stable and reliable air picture. In dense target situations the quality of available sensor data is reduced. System models...
121
click to vote
PODC
2003
ACM
15 years 5 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
100
click to vote
ICML
1996
IEEE
16 years 1 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
175
Voted
SIGMOD
2007
ACM
16 years 21 days ago
2007
ACM
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...