نتایج جستجو برای: sparse matrix
تعداد نتایج: 389027 فیلتر نتایج به سال:
In this paper, we study the problem of estimating covariance matrix under differential privacy, where underlying is assumed to be sparse and high dimensions. We propose a new method, called DP-Thresholding, achieve non-trivial ℓ2-norm based error bound whose dependence on dimension drops logarithmic instead polynomial, it significantly better than existing ones, which add noise directly empiric...
In this paper, a novel algorithm, Cross Low-dimension Pursuit, based on a new structured sparse matrix, Permuted Block Diagonal (PBD) matrix, is proposed in order to recover sparse signals from incomplete linear measurements. The main idea of the proposed method is using the PBD matrix to convert a high-dimension sparse recovery problem into two (or more) groups of highly low-dimension problems...
The sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate singleand multiple-SpMxV frameworks for exploiting c...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید