Sciweavers

3608 search results - page 345 / 722
» computing 2011
Sort
View
CORR
2011
Springer
157views Education» more  CORR 2011»
15 years 3 days ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
CORR
2011
Springer
189views Education» more  CORR 2011»
15 years 3 days ago
Volatility made observable at last
— The Cartier-Perrin theorem, which was published in 1995 and is expressed in the language of nonstandard analysis, permits, for the first time perhaps, a clear-cut mathematical...
Michel Fliess, Cédric Join, Fréd&eac...
CORR
2011
Springer
161views Education» more  CORR 2011»
15 years 3 days ago
Aorta Segmentation for Stent Simulation
Simulation of arterial stenting procedures prior to intervention allows for appropriate device selection as well as highlights potential complications. To this end, we present a fr...
Jan Egger, Bernd Freisleben, Randolph Setser, Rahu...
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 3 days ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
CORR
2011
Springer
195views Education» more  CORR 2011»
15 years 3 days ago
Simplicial Homology of Random Configurations
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
Laurent Decreusefond, Eduardo Ferraz, Hugues Randr...