394 search results - page 58 / 79 » Computing Minimal Polynomials of Matrices |
106
click to vote
SETA
2004
Springer
15 years 5 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
117
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
124
Voted
FPL
2008
Springer
15 years 2 months ago
2008
Springer
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
120
click to vote
COMAD
2009
15 years 1 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
103
Voted
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...