Sciweavers

580 search results - page 69 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
ICMCS
2008
IEEE
208views Multimedia» more  ICMCS 2008»
14 years 3 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
ICMCS
2008
IEEE
168views Multimedia» more  ICMCS 2008»
14 years 3 months ago
A co-design platform for algorithm/architecture design exploration
The efficient implementation of multimedia algorithms, for the ever increasing complexity of the specifications and the emergence of the new generation of processing platforms c...
Christophe Lucarz, Marco Mattavelli, Julien Dubois
ICCS
2001
Springer
14 years 1 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
TOG
2008
193views more  TOG 2008»
13 years 8 months ago
Random-access rendering of general vector graphics
We introduce a novel representation for random-access rendering of antialiased vector graphics on the GPU, along with efficient encoding and rendering algorithms. The representati...
Diego Nehab, Hugues Hoppe
ECOOP
2008
Springer
13 years 10 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...