951 search results - page 149 / 191 » On the Computation of Correctly-Rounded Sums |
121
click to vote
CMPB
2010
15 years 4 months ago
2010
We demonstrate the use of highly parallel graphics processing units (GPUs) to accelerate the Superposition/Convolution (S/C) algorithm to interactive rates while reducing the numbe...
112
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
129
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
121
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper considers an additive noise channel where the time-k noise variance is a weighted sum of the squared magnitudes of the previous channel inputs plus a constant. This chan...
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....