Sciweavers

9520 search results - page 1792 / 1904
» is 2011
Sort
View
168
Voted
DLOG
2011
14 years 8 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
DLOG
2011
14 years 8 months ago
Analysing Multiple Versions of an Ontology: A Study of the NCI Thesaurus
The detection of changes between OWL ontologies is an important service for ontology engineering. There are several approaches to this problem, both syntactic and semantic. A purel...
Rafael S. Gonçalves, Bijan Parsia, Ulrike S...
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 8 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
ECIR
2011
Springer
14 years 8 months ago
Combining Global and Local Semantic Contexts for Improving Biomedical Information Retrieval
In the context of biomedical information retrieval (IR), this paper explores the relationship between the document’s global context and the query’s local context in an attempt ...
Duy Dinh, Lynda Tamine
147
Voted
EDBT
2011
ACM
209views Database» more  EDBT 2011»
14 years 8 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...
« Prev « First page 1792 / 1904 Last » Next »