Results 91 to 100 of about 2,091,920 (156)

Matrix Completion under Interval Uncertainty [PDF]

, 2017
Matrix completion under interval uncertainty can be cast as a matrix completion problem with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem.
Richtárik, Peter, Mareček, Jakub, Takáč, Martin   +2 more
core   +1 more source

Leveraged Matrix Completion With Noise

IEEE Transactions on Cybernetics
This manuscript has been accepted for publication as a regular paper in the IEEE Transactions on ...
Xinjian Huang, Weiwei Liu 0003, Bo Du 0001, Dacheng Tao   +3 more
openaire   +3 more sources

The P0-matrix completion problem [PDF]

, 2002
In this paper the P0-matrix completion problem is considered. It is established that every asymmetric partial P0-matrix has P0-completion. All 4 × 4 patterns that include all diagonal positions are classified as either having P0-completion or not having ...
Hogben, Leslie, Maxwell, Mandi, Choi, Ji Young, Wangsness, Amy, DeAlba, Luz   +4 more
core  

SeqBMC: Single‐cell data processing using iterative block matrix completion algorithm based on matrix factorisation

IET Systems Biology
With the development of high‐throughput sequencing technology, the analysis of single‐cell RNA sequencing data has become the focus of current research.
Gong Lejun, Yu Like, Wei Xinyi, Zhou Shehai, Xu Shuhua   +4 more
doaj   +1 more source

Matrix completion and tensor rank [PDF]

Linear and Multilinear Algebra, 2015
In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.
openaire   +2 more sources

Graph Convolutional Matrix Completion

CoRR, 2017
9 pages, 3 figures, updated with additional experimental ...
van den Berg, R., Kipf, T.N., Welling, M.   +2 more
openaire   +3 more sources

The nonnegative P_0-matrix completion problem [PDF]

, 2003
In this paperthe nonnegative P0-matrix completion problem is considered. It isshown that a pattern for 4 × 4 matrices that includes all diagonal positions has nonnegative P0-completion if and only if its digraph is complete when it has a 4-cycle.
Kivunge, Benard M., Hogben, Leslie, Shedenhelm, Mike, Choi, Ji Young, DeAlba, Luz Maria, Nordstrom, Sandra, Nordstrom, Sandra K., Choi, Ji, DeAlba, Luz, Kivunge, Benard   +9 more
core   +1 more source

Approximation theory and matrix completions

Linear Algebra and its Applications, 2004
The authors start by proving some interesting results in low-dimensional matrix approximation problems. For example, they show that (1) a one-dimensional subspace \({\mathcal L}\) of \(M_n(\mathbb{C})\), the space of \(n\)-by-\(n\) complex matrices, is Chebyshev (that is, every matrix in \(M_n(\mathbb{C})\) has a unique approximant in \({\mathcal L}\))
Hadwin, D, Larson, D.R, Timotin, D
openaire   +2 more sources

Sensado de Espectro con Matrix Completion IZMA-SD para Redes Radio Cognitiva

Entre Ciencia e Ingeniería, 2019
Debido al crecimiento de las redes inalámbricas, se hace necesario un uso eficiente del espectro, una solución es Radio Cognitivo. En una de las etapas de esta tecnología se realiza el sensado de espectro, es decir determinar en una frecuencia si ...
Olger Ferledy Erazo De La Cruz, Víctor Fabián Miramá Pérez, Jorge Edison Mora Arroyo   +2 more
doaj   +1 more source

Matrix completion problems for pairs of related classes of matrices [PDF]

, 2003
For a class X of real matrices, a list of positions in an n×n matrix (a pattern) is said to have X-completion if every partial X-matrix that specifies exactly these positions can be completed to an X-matrix.
Hogben, Leslie
core