1322 search results - page 108 / 265 » Parameterized counting problems |
122
Voted
TCS
1998
15 years 2 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
157
Voted
CASES
2004
ACM
15 years 8 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
126
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
117
Voted
IACR
2011
14 years 2 months ago
2011
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
121
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...