3415 search results - page 177 / 683 » Lower Bounds for Kernelizations |
117
click to vote
HICSS
2008
IEEE
15 years 11 months ago
2008
IEEE
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
164
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
138
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
138
click to vote
DCC
2010
IEEE
15 years 11 months ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
137
click to vote
ISIPTA
2003
IEEE
15 years 10 months ago
2003
IEEE
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...