110 search results - page 1 / 22 » Greedy List Intersection |
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
ARSCOM
2008
13 years 5 months ago
2008
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
GD
2004
Springer
13 years 11 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
FSTTCS
2009
Springer
14 years 3 days ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...