1298 search results - page 174 / 260 » The online set cover problem |
201
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
183
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
177
click to vote
TALG
2008
15 years 6 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
154
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
169
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...