666 search results - page 112 / 134 » The Pipelined Set Cover Problem |
FOCS
2009
IEEE
14 years 4 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...
TALG
2008
13 years 10 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...
KDD
2004
ACM
14 years 10 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...
BMCBI
2008
13 years 10 months ago
2008
Background: In recent years, substantial effort has been applied to de novo regulatory motif discovery. At this time, more than 150 software tools exist to detect regulatory bindi...
ICPR
2004
IEEE
14 years 11 months ago
2004
IEEE
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...