11862 search results - page 11 / 2373 » Relative information completeness |
EFDBS
2001
13 years 9 months ago
2001
In this work, we consider augmenting SQL with constructs allowing dynamic restructuring. Dynamic restructuring occurs naturally in a framework including second-order capabilities f...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Related entity finding is the task of returning a ranked list of homepages of relevant entities of a specified type that need to engage in a given relationship with a given sour...
WAIM
2004
Springer
14 years 26 days ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
25
Voted
CAI
2009
Springer
13 years 5 months ago
2009
Springer
This paper studies conditions under which the operation of parallel insertion can be reversed by parallel deletion, i.e., when does the equality (L1 L2) L2 = L1 hold for language...
AIML
2004
13 years 9 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...