5 search results - page 1 / 1 » Efficient dot product over word-size finite fields |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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...
EMNLP
2009
13 years 2 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
COMBINATORICA
2008
13 years 5 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...