Sciweavers

249 search results - page 25 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
CCGRID
2011
IEEE
13 years 18 days ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
ICPR
2010
IEEE
13 years 7 months ago
An Efficient and Stable Algorithm for Learning Rotations
This paper analyses the computational complexity and stability of an online algorithm recently proposed for learning rotations. The proposed algorithm involves multiplicative upda...
Raman Arora, William A. Sethares
ICCV
2007
IEEE
14 years 3 months ago
Reconstructing the Surface of Inhomogeneous Transparent Scenes by Scatter-Trace Photography
We present a new method for reconstructing the exterior surface of a complex transparent scene with inhomogeneous interior (e.g., multiple interfaces, reflective or painted inter...
Nigel J. W. Morris, Kiriakos N. Kutulakos
PROCEDIA
2010
119views more  PROCEDIA 2010»
13 years 7 months ago
Performance and accuracy of Lattice-Boltzmann kernels on multi- and manycore architectures
We present different kernels based on Lattice-Boltzmann methods for the solution of the twodimensional Shallow Water and Navier-Stokes equations on fully structured lattices. The...
Dirk Ribbrock, Markus Geveler, Dominik Göddek...
DCC
2001
IEEE
14 years 8 months ago
Compression of the Layered Depth Image
A layered depth image (LDI) is a new popular representation and rendering method for objects with complex geometries. Similar to a 2D image, the LDI consists of an array of pixels...
Jiangang Duan, Jin Li