4155 search results - page 473 / 831 » External Memory Algorithms |
280
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
166
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
182
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
188
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
175
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...