Sciweavers

610 search results - page 49 / 122
» Fast Modular Reduction
Sort
View
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
15 years 10 months ago
A Fast Buffered Routing Tree Construction Algorithm under Accurate Delay Model
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
Yibo Wang, Yici Cai, Xianlong Hong
SIGMOD
2006
ACM
125views Database» more  SIGMOD 2006»
15 years 10 months ago
A non-linear dimensionality-reduction technique for fast similarity search in large databases
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
Khanh Vu, Kien A. Hua, Hao Cheng, Sheau-Dong Lang
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
15 years 6 months ago
Fast 3-D Inductance Extraction in Lossy Multi-Layer Substrate
A mixed potential integral equation (MPIE) technique combined with fast multi-layer Green’s functions and Gaussian Jacobi high order techniques is used to compute the 3-D freque...
Minqing Liu, Tiejun Yu, Wayne Wei-Ming Dai
APCSAC
2003
IEEE
15 years 3 months ago
Implementation of Fast Address-Space Switching and TLB Sharing on the StrongARM Processor
The StrongARM processor features virtually-addressed caches and a TLB without address-space tags. A naive implementation therefore requires flushing of all CPU caches and the TLB ...
Adam Wiggins, Harvey Tuch, Volkmar Uhlig, Gernot H...
FPL
2009
Springer
99views Hardware» more  FPL 2009»
15 years 2 months ago
Exploiting fast carry-chains of FPGAs for designing compressor trees
Fast carry chains featuring dedicated adder circuitry is a distinctive feature of modern FPGAs. The carry chains bypass the general routing network and are embedded in the logic b...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne