Sciweavers

861 search results - page 21 / 173
» Faster integer multiplication
Sort
View
CASES
2006
ACM
13 years 11 months ago
Reaching fast code faster: using modeling for efficient software thread integration on a VLIW DSP
When integrating software threads together to boost performance on a processor with instruction-level parallel processing support, it is rarely clear which code regions should be ...
Won So, Alexander G. Dean
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 7 months ago
Compressed Modular Matrix Multiplication
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
14 years 1 months ago
Fast Sparse Matrix Multiplication
Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B usi...
Raphael Yuster, Uri Zwick
CISS
2008
IEEE
14 years 2 months ago
A linear integer programming approach to analyze P2P media streaming
Recent advancement in peer-to-peer (P2P) technologies has enabled a wide range of new applications. In this paper, we present mixed integer programming (MIP) formulations to analy...
Fulu Li, Jianwei Huang, Andrew Lippman
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
13 years 11 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate