Found 7 document(s)
Page 1 of 1
-
The number of scalar multiplications required to multiply a $3\times4$ matrix by a $4\times7$ matrix was reduced from 66 in [11] to 63 in [9] by an algorithm over complex numbers. We propose an algorithm in 63 multiplica...
-
We present new two-party protocols for the Unbalanced Private Set Union (UPSU) problem. Here, the Sender holds a set of data points, and the Receiver holds another (possibly much larger) set, and they would like for the ...
-
Les monnaies virtuelles permettent de transférer de l'argent sans avoir besoin de support physique et, généralement, sans faire appel à un intermédiaire. Elles doivent avoir au moins les mêmes propriétés de sécurité que ...
-
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization P T AP = LDL T where P is a perm...
-
An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and the...
-
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 several modular operations with machine intege...
-
Nous donnons une nouvelle caractérisation des quenines, puis prouvons une conjecture sur l'orientation des rayons spirales. Nous donnons les équivalences entre les battements de cartes définis par Peter Asveld et les que...