361 search results - page 58 / 73 » Maximum subset intersection |
VLDB
2004
ACM
14 years 3 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
BIRTHDAY
2009
Springer
14 years 1 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
ISAAC
2000
Springer
14 years 1 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...