Sparse matrix-matrix multiplication (SpMM) is a crucial kernel in various applications, including sparse deep neural networks [1]–[6], graph analytics [7], triangle counting [8], and linear algebra ...
Abstract: In this communication, we propose a method to synthesize sparse linear arrays using low-rank Hankle matrix completion. With the given metrics (e.g., peak sidelobe level (PSL), mainlobe width ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results