Sciweavers

1688 search results - page 51 / 338
» Implementing Optimizations at Decode Time
Sort
View
AES
2000
Springer
82views Cryptology» more  AES 2000»
14 years 10 days ago
Fast Implementations of AES Candidates
Of the five AES finalists four—MARS, RC6, Rijndael, Twofish— have not only (expected) good security but also exceptional performance on the PC platforms, especially on those...
Kazumaro Aoki, Helger Lipmaa
IEEECIT
2010
IEEE
13 years 6 months ago
Parallel Best Neighborhood Matching Algorithm Implementation on GPU Platform
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Guangyong Zhang, Liqiang He, Yanyan Zhang
DCC
2002
IEEE
14 years 7 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
DCC
2008
IEEE
14 years 7 months ago
Sublinear Recovery of Sparse Wavelet Signals
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
Ray Maleh, Anna C. Gilbert
MICRO
1993
IEEE
97views Hardware» more  MICRO 1993»
14 years 3 days ago
Register renaming and dynamic speculation: an alternative approach
In this paper, we present a novel mechanism that implements register renaming, dynamic speculation and precise interrupts. Renaming of registers is performed during the instructio...
Mayan Moudgill, Keshav Pingali, Stamatis Vassiliad...