2766 search results - page 106 / 554 » Algorithms for trigonometric polynomials |
115
click to vote
EUROPAR
2001
Springer
15 years 8 months ago
2001
Springer
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...
131
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
106
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
136
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
168
click to vote
ASPDAC
2008
ACM
15 years 5 months ago
2008
ACM
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...