Sciweavers

131 search results - page 8 / 27
» Optimization techniques for small matrix multiplication
Sort
View
STACS
1999
Springer
15 years 1 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
IWCMC
2010
ACM
14 years 11 months ago
Joint network coding and beamforming techniques for downlink channels
We propose a joint optimization of Network Coding and MIMO techniques to improve the downlink channel throughput of a wireless base station. Specifically, we consider a MIMO base...
Monchai Lertsutthiwong, Thinh Nguyen, Bechir Hamda...
ICCV
2003
IEEE
15 years 11 months ago
Spectral Partitioning for Structure from Motion
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
Drew Steedly, Irfan A. Essa, Frank Dellaert
90
Voted
CDC
2009
IEEE
154views Control Systems» more  CDC 2009»
15 years 2 months ago
On the optimal design of structured feedback gains for interconnected systems
— We consider the design of optimal static feedback gains for interconnected systems subject to architectural constraints on the distributed controller. These constraints are in ...
Makan Fardad, Fu Lin, Mihailo R. Jovanovic
89
Voted
CSE
2009
IEEE
15 years 1 months ago
A Comparative Study of Blocking Storage Methods for Sparse Matrices on Multicore Architectures
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...