Sciweavers

491 search results - page 4 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
ICTAI
2008
IEEE
14 years 1 months ago
Answering Complex Questions Using Query-Focused Summarization Technique
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
Yllias Chali, Shafiq R. Joty
ECML
2006
Springer
13 years 11 months ago
Unsupervised Multiple-Instance Learning for Functional Profiling of Genomic Data
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
Corneliu Henegar, Karine Clément, Jean-Dani...
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 7 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
GIS
2005
ACM
14 years 8 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 7 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li