Results 11 to 20 of about 53,358 (305)
Optimal sequence for chain matrix multiplication using evolutionary algorithm [PDF]
The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM).
Umer Iqbal +7 more
doaj +3 more sources
Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
Karppa & Kaski (2019) proposed a novel ``broken or ``opportunistic matrix multiplication algorithm, based on a variant of Strassen\u27s algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks.
Harris, David G.
core +5 more sources
In this paper, a new matrix multiplication is defined in R-m,R-n x R-n,R-p by using scalar product in R-n, where R-m,R-n is set of matrices of m rows and n columns. With this multiplication it has been shown that R-n,R-n is an algebra with unit.
Kecilioglu, Osman, Gundogan, Halit
core +3 more sources
Locally Encoded Secure Distributed Batch Matrix Multiplication [PDF]
We study the problem of locally encoded secure distributed batch matrix multiplication (LESDBMM), where M pairs of sources each encode their respective batches of massive matrices and distribute the generated shares to a subset of N worker nodes.
Haobo Jia, Zhuqing Jia
doaj +2 more sources
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication [PDF]
We propose a fine-grained hypergraph model for sparse matrix-matrix multiplication (SpGEMM), a key computational kernel in scientific computing and data analysis whose performance is often communication bound. This model correctly describes both the interprocessor communication volume along a critical path in a parallel computation and also the volume ...
Grey Ballard +2 more
exaly +3 more sources
Fast Kronecker Matrix-Matrix Multiplication on GPUs
Kronecker Matrix-Matrix Multiplication (Kron-Matmul) is the multiplication of a matrix with the Kronecker Product of several smaller matrices. Kron-Matmul is a core operation for many scientific and machine learning computations.
Jangda, Abhinav, Yadav, Mohit
core +2 more sources
Faster quantum subroutine for matrix chain multiplication via Chebyshev approximation [PDF]
Matrix operations are crucial to various computational tasks in various fields, and quantum computing offers a promising avenue to accelerate these operations. We present a quantum matrix multiplication (QMM) algorithm that employs amplitude encoding and
Xinying Li +5 more
doaj +2 more sources
Matrix multiplication via matrix groups
15 ...
Jonah Blasiak +4 more
openaire +4 more sources
Neon NTT: Faster Dilithium, Kyber, and Saber on Cortex-A72 and Apple M1
We present new speed records on the Armv8-A architecture for the latticebased schemes Dilithium, Kyber, and Saber. The core novelty in this paper is the combination of Montgomery multiplication and Barrett reduction resulting in “Barrett multiplication ...
Hanno Becker +4 more
doaj +1 more source
Implementation of the Spark technique in a matrix distributed computing algorithm
Two analyzes of Spark engine performance strategies to implement the Spark technique in a matrix distributed computational algorithm, the multiplication of a sparse multiplication operational test model.
Wang Ying, Cengiz Korhan
doaj +1 more source

