995 search results - page 95 / 199 » complexity 2011 |
137
Voted
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate ...
129
click to vote
EUROPAR
2011
Springer
14 years 3 months ago
2011
Springer
DOALL loops are tiled to exploit DOALL parallelism and data locality on GPUs. In contrast, due to loop-carried dependences, DOACROSS loops must be skewed first in order to make ti...
157
Voted
FPL
2011
Springer
14 years 3 months ago
2011
Springer
Abstract—Soft on-FGPA interconnection networks are gaining increasing importance since they simplify the integration of heterogeneous components and offer, at the same time, a mo...
124
click to vote
ICC
2011
IEEE
14 years 3 months ago
2011
IEEE
—This paper presents an approach to implement a high-performance 8-tap digital FIR (Finite Impulse Response) filter using the Logarithmic Number System. In the past, FIR filter...
254
Voted
ICC
2011
IEEE
14 years 3 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...