Sciweavers

2745 search results - page 118 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
133
Voted
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 3 months ago
Fast Selection of Spectral Variables with B-Spline Compression
The large number of spectral variables in most data sets encountered in spectral chemometrics often renders the prediction of a dependent variable uneasy. The number of variables ...
Fabrice Rossi, Damien François, Vincent Wer...
155
Voted
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 3 months ago
Fast space-variant elliptical filtering using box splines
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...
IPPS
2007
IEEE
15 years 10 months ago
Performance Analysis of a Family of WHT Algorithms
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
Michael Andrews, Jeremy Johnson
172
Voted
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 10 months 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...
HPCA
2005
IEEE
16 years 4 months ago
A Small, Fast and Low-Power Register File by Bit-Partitioning
A large multi-ported register file is indispensable for exploiting instruction level parallelism (ILP) in today's dynamically scheduled superscalar processors. The number of ...
Masaaki Kondo, Hiroshi Nakamura