Sciweavers

47 search results - page 5 / 10
» FAST: Frequency-Aware Static Timing Analysis
Sort
View
WWW
2005
ACM
14 years 8 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
ICCAD
1999
IEEE
115views Hardware» more  ICCAD 1999»
13 years 12 months ago
Fast performance analysis of bus-based system-on-chip communication architectures
This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. ...
Kanishka Lahiri, Anand Raghunathan, Sujit Dey
AES
2000
Springer
82views Cryptology» more  AES 2000»
13 years 12 months 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
CGO
2008
IEEE
14 years 2 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
ICFP
1997
ACM
13 years 11 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves