1278 search results - page 132 / 256 » The Complexity of Weighted Boolean |
151
Voted
SOFSEM
1999
Springer
15 years 7 months ago
1999
Springer
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
110
Voted
DAGSTUHL
2006
15 years 5 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
126
Voted
PODS
2010
ACM
15 years 3 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
129
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
127
Voted
TCS
1998
15 years 3 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...