Sciweavers

131 search results - page 2 / 27
» Optimization techniques for small matrix multiplication
Sort
View
PARA
2004
Springer
13 years 10 months ago
A Family of High-Performance Matrix Multiplication Algorithms
During the last half-decade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include ...
John A. Gunnels, Fred G. Gustavson, Greg Henry, Ro...
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
13 years 11 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
ICCV
2009
IEEE
14 years 9 months ago
Tensor completion for estimating missing values in visual data
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 8 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
SIGCOMM
1996
ACM
13 years 9 months ago
Speeding up Protocols for Small Messages
Many techniques have been discovered to improve performance of bulk data transfer protocols which use large messages. This paper describes a technique that improves protocol perfo...
Trevor Blackwell