2981 search results - page 304 / 597 » Answer Set Planning |
140
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
160
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
In the paper we discuss the problem of data integration in a P2P environment. In such setting each peer stores schema of its local data, mappings between the schema and schemas of...
158
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
133
click to vote
WEBDB
2009
Springer
15 years 11 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
131
click to vote
FQAS
2009
Springer
15 years 11 months ago
2009
Springer
Information extraction systems have been dealt with at length from the viewpoint of users posing definite questions whose expected answer is to be found in a document collection. T...