Abstract: In this paper, we propose a novel construction for secure distributed matrix multiplication (SDMM) based on algebraic geometry (AG) codes, which we call the PoleGap SDMM scheme. The proposed ...

Abstract: Structured sparsity has been proposed as an efficient way to prune the complexity of Machine Learning (ML) applications and to simplify the handling of sparse data in hardware. Accelerating ...

Let $A$ be an $n \times n$ Boolean matrix representing a directed graph, where $A[i,j] = 1$ if there is an edge from vertex $i$ to vertex $j$, and $A[i,j] = 0 ...

Choose a character, then add, subtract, divide and multiply numbers to battle your way to victory in this fun maths game. Challenge yourself across 11 KS2 maths topics from the Mysterious Mountains of ...

Let $A$ be a Boolean $n \times n$ matrix whose transitive closure we wish to compute. We denote the transitive closure of $A$ by $A^*$, which is the smallest Boolean ...