3415 search results - page 291 / 683 » Lower bounds on kernelization |
146
click to vote
TIT
2008
15 years 6 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
193
click to vote
DM
2002
15 years 6 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
182
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
162
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we study the diversity-multiplexing tradeoff (DMT) of two-way relay channels (TWRC) with multiantenna relay at finite signal-to-noise ratio (SNR). A two-phase decode...
163
click to vote
TIT
2011
15 years 1 months ago
2011
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...