53 search results - page 5 / 11 » Affine Grassmann codes |
IEEEPACT
1999
IEEE
13 years 11 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
ICS
2005
Tsinghua U.
14 years 29 days ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...