4526 search results - page 664 / 906 » Algorithmic problems related to the Internet |
120
click to vote
ICDT
1995
ACM
15 years 8 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
139
click to vote
VLDB
1987
ACM
15 years 8 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
142
Voted
AAAI
1998
15 years 6 months ago
1998
The World Wide Web is a vast source of information accessible to computers, but understandable only to humans. The goal of the research described here is to automatically create a...
140
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
134
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...