5 search results - page 1 / 1 » Efficient dot product over word-size finite fields |
89
Voted
CORR
2004
Springer
15 years 8 days 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...
104
click to vote
CORR
2008
Springer
15 years 15 days 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
15 years 15 days 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...
133
click to vote
EMNLP
2009
14 years 10 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, ...
103
Voted
COMBINATORICA
2008
15 years 15 days 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...