Sciweavers

1523 search results - page 109 / 305
» The Computational Complexity of Linear Optics
Sort
View
116
Voted
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 10 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
FGCS
2008
127views more  FGCS 2008»
15 years 3 months ago
Monte Carlo methods for matrix computations on the grid
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
Simon Branford, Cihan Sahin, Ashish Thandavan, Chr...
123
Voted
DAC
2006
ACM
16 years 4 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
116
Voted
VIIP
2001
15 years 4 months ago
Using Graphics Cards for Quantized FEM Computations
Graphics cards exercise increasingly more computing power and are highly optimized for high data transfer volumes. In contrast typical workstations perform badly when data exceeds...
Martin Rumpf, Robert Strzodka
130
Voted
IPPS
2000
IEEE
15 years 8 months ago
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity ON , where 2  3. We show that such an algorithm can be parallelize...
Keqin Li