439 search results - page 19 / 88 » Unnesting Arbitrary Queries |
159
click to vote
JAIR
2012
13 years 4 months ago
2012
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
112
click to vote
ALT
2010
Springer
15 years 4 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
104
click to vote
DBPL
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
104
Voted
DBPL
2007
Springer
15 years 8 months ago
2007
Springer
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
121
click to vote
ICCSA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...