Sciweavers

2043 search results - page 20 / 409
» The Limits of Querying Ontologies
Sort
View
AAAI
2007
15 years 3 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
ER
2008
Springer
110views Database» more  ER 2008»
15 years 3 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
COLT
2004
Springer
15 years 6 months ago
Replacing Limit Learners with Equally Powerful One-Shot Query Learners
Different formal learning models address different aspects of human learning. Below we compare Gold-style learning—interpreting learning as a limiting process in which the lear...
Steffen Lange, Sandra Zilles
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 9 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 2 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei