507 search results - page 40 / 102 » Computing Sparse Multiples of Polynomials |
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. The Joint Sparse Form is currently the standard representation system to perform multi-scalar multiplications of the form [n]P + m[Q]. We introduce the concept of Joint D...
PC
2002
13 years 7 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
FQ
2003
Springer
14 years 1 months ago
2003
Springer
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we analyze the performance of group based detection in sparse sensor networks, when the system level detection decision is made based on the detection reports gener...