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 ...
% is simply X_k+1 = X_k * exp(u_k + w_k) where % X_k is in SE(2), u_k is the twist in se(2), and w_k is N(0,Q_k) and defined % in the Lie algebra se(2). We use Monte Carlo methods to propagate samples ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results