5115 search results - page 57 / 1023 » On Randomized Lanczos Algorithms |
SODA
2010
ACM
14 years 10 months ago
2010
ACM
WAW
2010
Springer
14 years 9 months ago
2010
Springer
WDAG
2005
Springer
15 years 5 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
DAC
2009
ACM
15 years 6 months ago
2009
ACM
This paper proposes an equation-based multi-scenario iterative robust optimization methodology for analog/mixed-signal circuits. We show that due to local circuit performance mono...