Sciweavers

24 search results - page 2 / 5
» A fast variant of the Gaussian reduction algorithm
Sort
View
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 7 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
PR
2007
194views more  PR 2007»
13 years 5 months ago
Decolorize: Fast, contrast enhancing, color to grayscale conversion
We present a new contrast enhancing color to grayscale conversion algorithm which works in real-time. It incorporates novel techniques for image sampling and dimensionality reduct...
Mark Grundland, Neil A. Dodgson
PPOPP
2010
ACM
14 years 3 months ago
Fast tridiagonal solvers on the GPU
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
Yao Zhang, Jonathan Cohen, John D. Owens
WSC
2000
13 years 7 months ago
Variance reduction techniques for value-at-risk with heavy-tailed risk factors
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
Paul Glasserman, Philip Heidelberger, Perwez Shaha...
ARITH
2005
IEEE
13 years 11 months ago
A Fast-Start Method for Computing the Inverse Tangent
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...
Peter W. Markstein