Sciweavers

6251 search results - page 116 / 1251
» Randomness, Computability, and Density
Sort
View
100
Voted
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
14 years 7 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
78
Voted
ISBI
2006
IEEE
15 years 6 months ago
A comparative study of popular interpolation and integration methods for use in computed tomography
We compare various popular methods available for projection and backprojection in CT. Assuming linear rays and a simple density integration along them, we consider both line- and ...
Fang Xu, Klaus Mueller
CDES
2006
99views Hardware» more  CDES 2006»
15 years 2 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
CCA
2009
Springer
15 years 7 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
HOTI
2008
IEEE
15 years 7 months ago
Optical Interconnects for Present and Future High-Performance Computing Systems
Optical interconnects are useful for high-performance electronic computing systems when the number-ofchannels, the bit-rate per channel, the channel density, and the communication...
Ashok V. Krishnamoorthy, Jon Lexau, Xuezhe Zheng, ...