61 search results - page 9 / 13 » Arbitrary Bit Permutations in One or Two Cycles |
119
Voted
ACMMSP
2004
ACM
15 years 8 months ago
2004
ACM
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
107
Voted
SIROCCO
2010
15 years 4 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
100
click to vote
AES
2000
Springer
15 years 7 months ago
2000
Springer
We compare the five candidates for the Advanced Encryption Standard based on their performance on the Alpha 21264, a 64-bit superscalar processor. There are several new features o...
141
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
135
click to vote
RTCSA
2007
IEEE
15 years 9 months ago
2007
IEEE
— To use the tremendous hardware resources available in next generation MultiProcessor Systems-on-Chip (MPSoC) efficiently, rapid and accurate design space exploration (DSE) met...