995 search results - page 35 / 199 » complexity 2011 |
100
Voted
IACR
2011
14 years 2 months ago
2011
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
113
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Recent studies have investigated lattice-reduction (LR) preprocessing technique for multiple-inputmultiple-output (MIMO) detection. However, if LR is applied to the orthogonalfreq...
197
Voted
CODCRY
2011
Springer
14 years 6 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
129
click to vote
SIAMCO
2011
14 years 9 months ago
2011
Let R be a commutative complex Banach algebra with the involution ·⋆ and suppose that A ∈ Rn×n , B ∈ Rn×m , C ∈ Rp×n . The question of when the Riccati equation PBB⋆ ...
227
Voted
ICANN
2011
Springer
14 years 6 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...