923 search results - page 125 / 185 » On the Computation of Relational View Complements |
185
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
146
click to vote
SI3D
1997
ACM
15 years 10 months ago
1997
ACM
The requirement to change scale frequently is common to many 2D and 3D applications. Users must “zoom in” to examine details and “zoom out” to appreciate the context. This...
196
click to vote
TARK
1992
Springer
15 years 10 months ago
1992
Springer
We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logi...
158
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
144
click to vote
IJCAI
1997
15 years 7 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...