1322 search results - page 78 / 265 » Parameterized counting problems |
FOCS
1996
IEEE
14 years 1 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
MST
2007
13 years 8 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
DEXA
2005
Springer
14 years 2 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Many large-scale clusters now have hundreds of thousands of processors, and processor counts will be over one million within a few years. Computational scientists must scale their ...
FCT
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...