Results 31 to 40 of about 43,727 (260)

Robust Dictionary Learning and Sparse Coding With Riemannian Geometry Preserving Method in Symmetric Matrices Inner Product Space

open access: yesIEEE Access, 2020
Existing Dictionary Learning and Sparse Coding (DLSC) algorithms for Symmetric Positive Definite (SPD) matrices usually adopt Reproducing Kernel Hilbert Space as workspace to perform necessary linear operations.
Yang Zhang, Yuesheng Zhu
doaj   +1 more source

Direct multiplicative methods for sparse matrices. Quadratic programming [PDF]

open access: yesКомпьютерные исследования и моделирование, 2018
A numerically stable direct multiplicative method for solving systems of linear equations that takes into account the sparseness of matrices presented in a packed form is considered.
Anastasiya Borisovna Sviridenko
doaj   +1 more source

An introduction to Sparse Matrices

open access: yesIrish Mathematical Society Bulletin, 1985
The author gives a concise introduction to sparse matrices. First, the history and goals of sparse matrices are outlined. (The reviewer's book Sparse matrices (1973; Zbl 0262.65021) which was the first text in this area is inadvertently not mentioned.) The second part of this paper deals with a description of storage schemes.
openaire   +2 more sources

Sparse Recovery With Block Multiple Measurement Vectors Algorithm

open access: yesIEEE Access, 2019
This paper investigates the performance of the block multiple measurement vectors (BMMV) algorithm in reconstructing block joint sparse matrices. We prove that if 41) obeys block restricted isometry property with 8 K+1 <; Nf +1 , then BMMV perfectly ...
Yanli Shi, Libo Wang, Rong Luo
doaj   +1 more source

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

CoD-SELL: A Non-Zero Location Dictionary Compression Sparse Matrix Format for SpMV on GPU

open access: yesIEEE Access
Sparse matrix-vector multiplication (SpMV) is a fundamental computational kernel extensively utilized in scientific computing. To accelerate SpMV, various sparse matrix formats have been proposed.
Shun Murakami   +4 more
doaj   +1 more source

Interaction of HS1BP3 with cortactin modulates TKS5 localisation, cell secretion and cancer malignancy

open access: yesMolecular Oncology, EarlyView.
Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen   +9 more
wiley   +1 more source

Fast Matrix Multiplication with Big Sparse Data

open access: yesCybernetics and Information Technologies, 2017
Big Data becameabuzz word nowadays due to the evolution of huge volumes of data beyond peta bytes. This article focuses on matrix multiplication with big sparse data.
Somasekhar G., Karthikeyan K.
doaj   +1 more source

Bayesian mmWave Channel Estimation via Exploiting Joint Sparse and Low-Rank Structures

open access: yesIEEE Access, 2019
We consider the problem of channel estimation for millimeter wave (mmWave) systems, where both the base station and the mobile station employ a single radio frequency (RF) chain to reduce the hardware cost and power consumption. Recent real-world channel
Kaihui Liu   +3 more
doaj   +1 more source

Direct multiplicative methods for sparse matrices. Newton methods [PDF]

open access: yesКомпьютерные исследования и моделирование, 2017
We consider a numerically stable direct multiplicative algorithm of solving linear equations systems, which takes into account the sparseness of matrices presented in a packed form. The advantage of the algorithm is the ability to minimize the filling of
Anastasiya Borisovna Sviridenko
doaj   +1 more source

Home - About - Disclaimer - Privacy