Sciweavers

171 search results - page 22 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
CTRSA
2005
Springer
108views Cryptology» more  CTRSA 2005»
14 years 28 days ago
A Systematic Evaluation of Compact Hardware Implementations for the Rijndael S-Box
This work proposes a compact implementation of the AES S-box using composite field arithmetic in GF(((22 ) 2 ) 2 ). It describes a systematic exploration of different choices for...
Nele Mentens, Lejla Batina, Bart Preneel, Ingrid V...
STACS
2001
Springer
13 years 11 months ago
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
Dexter Kozen
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 8 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
MP
2010
150views more  MP 2010»
13 years 2 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
TSMC
2010
13 years 2 months ago
Cyclorotation Models for Eyes and Cameras
The human visual system obeys Listing's law, which means that the cyclorotation of the eye (around the line of sight) can be predicted from the direction of the fixation point...
Miles E. Hansard, Radu Horaud