Sciweavers

2043 search results - page 154 / 409
» The Limits of Querying Ontologies
Sort
View
AAAI
2006
13 years 10 months ago
Large Scale Knowledge Base Systems: An Empirical Evaluation Perspective
In this paper, we discuss how our work on evaluating Semantic Web knowledge base systems (KBSs) contributes to address some broader AI problems. First, we show how our approach pr...
Yuanbo Guo, Abir Qasem, Jeff Heflin
BIBM
2008
IEEE
212views Bioinformatics» more  BIBM 2008»
14 years 3 months ago
Analysis of Multiplex Gene Expression Maps Obtained by Voxelation
Background: Gene expression signatures in the mammalian brain hold the key to understanding neural development and neurological disease. Researchers have previously used voxelatio...
Li An, Hongbo Xie, Mark H. Chin, Zoran Obradovic, ...
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
14 years 10 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
PODS
2007
ACM
108views Database» more  PODS 2007»
14 years 9 months ago
Machine models and lower bounds for query processing
This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where...
Nicole Schweikardt
CADE
2006
Springer
14 years 9 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...