3415 search results - page 432 / 683 » Lower bounds on kernelization |
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
131
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. In this p...
180
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
177
click to vote
DM
2010
15 years 6 months ago
2010
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...