3415 search results - page 19 / 683 » Lower Bounds for Kernelizations |
CORR
2007
Springer
13 years 11 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
COCO
2007
Springer
14 years 5 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
AAAI
2010
13 years 9 months ago
2010
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
IWDW
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Many coded digital watermarking systems development requires first the selection of a (uncoded) modulation technique to be part of a coded architecture. Therefore, perfo...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...