Sciweavers

522 search results - page 40 / 105
» Fast Smith-Waterman hardware implementation
Sort
View
SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
14 years 5 days ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan
ARCS
2004
Springer
13 years 11 months ago
STAFF: State Transition Applied Fast Flash Translation Layer
Abstract. Recently, flash memory is widely used in embedded applications since it has strong points: non-volatility, fast access speed, shock resistance, and low power consumption....
Tae-Sun Chung, Stein Park, Myung-Jin Jung, Bumsoo ...
JAL
1998
74views more  JAL 1998»
13 years 7 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon
ICCAD
2010
IEEE
191views Hardware» more  ICCAD 2010»
13 years 1 months ago
Current Shaping and Multi-thread Activation for Fast and Reliable Power Mode Transition in Multicore Designs
Power gating has been widely adopted in multicore designs. The design of fast and reliable power mode transition for per-core power gating remains a challenging problem. This paper...
Hao Xu Ranga Vemuri Wen-Ben Jone
IJCV
2000
109views more  IJCV 2000»
13 years 7 months ago
Fast Lighting Independent Background Subtraction
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using...
Yuri A. Ivanov, Aaron F. Bobick, John Liu