3373 search results - page 75 / 675 » Linear transformations on codes |
EUROCRYPT
2012
Springer
13 years 8 days ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
136
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Recently SVMs using spatial pyramid matching (SPM)
kernel have been highly successful in image classification.
Despite its popularity, these nonlinear SVMs have a complexity
O(n...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract--Discrete multitone modulation (DMT) systems exploit the capabilities of orthogonal subcarriers to cope efficiently with narrowband interference, high frequency attenuatio...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
EUROPAR
2008
Springer
14 years 11 months ago
2008
Springer
We describe a software solution to the problem of automatic parallelization of linear algebra code on multi-processor and multi-core architectures. This solution relies on the defi...