145 search results - page 4 / 29 » Fast, Randomized Join-Order Selection - Why Use Transformati... |
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
AAIM
2006
Springer
14 years 2 months ago
2006
Springer
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
ICPP
2008
IEEE
14 years 3 months ago
2008
IEEE
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
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...
EUROCAST
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register...