Sciweavers

921 search results - page 9 / 185
» Abstract Matrix Arithmetic
Sort
View
ICS
1999
Tsinghua U.
13 years 11 months ago
High-level semantic optimization of numerical codes
This paper presents a mathematical framework to exploit the semantic properties of matrix operations in loop-based numerical codes. The heart of this framework is an algebraic lan...
Vijay Menon, Keshav Pingali
FCCM
2007
IEEE
107views VLSI» more  FCCM 2007»
14 years 1 months ago
Optimizing Logarithmic Arithmetic on FPGAs
This paper proposes optimizations of the methods and parameters used in both mathematical approximation and hardware design for logarithmic number system (LNS) arithmetic. First, ...
Haohuan Fu, Oskar Mencer, Wayne Luk
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
14 years 1 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
MOC
2002
86views more  MOC 2002»
13 years 7 months ago
Ten consecutive primes in arithmetic progression
Abstract. In 1967 the first set of 6 consecutive primes in arithmetic progression was found. In 1995 the first set of 7 consecutive primes in arithmetic progression was found. Betw...
Harvey Dubner, Tony Forbes, Nik Lygeros, Michel Mi...
FSTTCS
2008
Springer
13 years 8 months ago
Dynamic matrix rank with partial lookahead
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
Telikepalli Kavitha