Sciweavers

1085 search results - page 15 / 217
» On the performance of one-to-many data transformations
Sort
View
EDBT
2009
ACM
98views Database» more  EDBT 2009»
14 years 2 months ago
A runtime approach to model-independent schema and data translation
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...
Paolo Atzeni, Luigi Bellomarini, Francesca Bugiott...
IPPS
2007
IEEE
14 years 1 months ago
Optimizing Inter-Nest Data Locality Using Loop Splitting and Reordering
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
Sofiane Naci
ISCAS
2007
IEEE
202views Hardware» more  ISCAS 2007»
14 years 1 months ago
A VLSI Architecture for a Fast Computation of the 2-D Discrete Wavelet Transform
In this paper, an efficient VLSI architecture for a fast computation of the 2-D discrete wavelet transform (DWT) is proposed. The architecture employing a three-stage cascade in p...
Chengjun Zhang, Chunyan Wang, M. Omair Ahmad
DCC
2008
IEEE
14 years 7 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
ICMCS
2008
IEEE
208views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Fast computation of general Fourier Transforms on GPUS
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
Brandon Lloyd, Chas Boyd, Naga K. Govindaraju