Results 51 to 60 of about 1,040,614 (343)
IEEE Transactions on Neural Networks and Learning Systems, 2016 Nonnegative matrix factorization (NMF)-based models possess fine representativeness of a target matrix, which is critically important in collaborative filtering (CF)-based recommender systems.
Xin Luo +5 more
semanticscholar +1 more source
On sparse random combinatorial matrices
Discrete Mathematics, 2022 Let $Q_{n,d}$ denote the random combinatorial matrix whose rows are independent of one another and such that each row is sampled uniformly at random from the subset of vectors in $\{0,1\}^n$ having precisely $d$ entries equal to $1$. We present a short proof of the fact that $\Pr[\det(Q_{n,d})=0] = O\left(\frac{n^{1/2}\log^{3/2} n}{d}\right)=o(1 ...
Elad Aigner-Horev, Yury Person
openaire +2 more sources
Scalable task-based algorithm for multiplication of block-rank-sparse matrices [PDF]
IA3@SC, 2015 A task-based formulation of Scalable Universal Matrix Multiplication Algorithm (SUMMA), a popular algorithm for matrix multiplication (MM), is applied to the multiplication of hierarchy-free, rank-structured matrices that appear in the domain of quantum ...
Justus A. Calvin +2 more
semanticscholar +1 more source
Sparse Recovery With Block Multiple Measurement Vectors Algorithm
IEEE 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
IEEE 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. Linear programming [PDF]
Компьютерные исследования и моделирование, 2017 Multiplicative methods for sparse matrices are best suited to reduce the complexity of operations solving systems of linear equations performed on each iteration of the simplex method.
Anastasiya Borisovna Sviridenko
doaj +1 more source
Quasi-randomness and algorithmic regularity for graphs with general degree distributions [PDF]
, 2010 We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one.
Schacht, Mathias +5 more
core +1 more source
An introduction to Sparse Matrices
Irish 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
Direct multiplicative methods for sparse matrices. Quadratic programming [PDF]
Компьютерные исследования и моделирование, 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
Spectra of random matrices [PDF]
, 2022 The recent interest of the scientific community about the properties of networks is based on the possibility to study complex real world systems by renouncing the exact knowledge of the nature of system itself.
Martina, Silvia
core