171 search results - page 26 / 35 » On Chebyshev Polynomials of Matrices |
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...