Results 261 to 270 of about 435,592 (297)
Some of the next articles are maybe not open access.
DRIMC: an improved drug repositioning approach using Bayesian inductive matrix completion
Bioinform., 2020MOTIVATION One of the most important problems in drug discovery research is to precisely predict a new indication for an existing drug, i.e. drug repositioning.
Wenjuan Zhang +4 more
semanticscholar +1 more source
A Note on Matrix Completion Problems
Algebra Colloquium, 2012Matrix completion problems are an important subclass of problems in matrix theory. An important question in matrix completion problems was posed by Oliveira in 1975, where the author proposed the description of the characteristic polynomial of a partitioned matrix of the form A = [Ai,j], i, j ∈ {1,2} (whose entries are in a field and A1,1, A2,2 are ...
openaire +2 more sources
Matrix completion problems in multidimensional systems
ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349), 2003A ring with identity is Hermite if every unimodular row vector over the ring can be completed to form a unimodular square matrix over the ring. This paper constructs examples and counter-examples of Hermite rings and formulates several open problems, which have potential applications in multidimensional systems.
Lawton, Wayne M., Lin, Zhiping
openaire +1 more source
Some Remarks on Matrix Completion Problems
IFAC Proceedings Volumes, 2001Abstract The matrix completion problem introduced in (Loiseau et al., 1998) is reconsidered and the latest results achieved in that field are discussed.
Jean Jacques Loiseau +2 more
openaire +1 more source
Matrix Completion Based on Non-Convex Low-Rank Approximation
IEEE Transactions on Image Processing, 2019Without any prior structure information, nuclear norm minimization (NNM), a convex relaxation for rank minimization (RM), is a widespread tool for matrix completion and relevant low-rank approximation problems.
F. Nie, Zhanxuan Hu, Xuelong Li
semanticscholar +1 more source
Matrix completion problems of block type
Mathematical Notes, 2000Block matrices of dimension \(n\times n\) over a field with characteristic zero are considered which are partitioned into \(2\times 2\)-block matrices such that both blocks in the diagonal are square. The authors consider the cases that one or both blocks in the first row of this block matrix are given. It is shown that completion of such a matrix to a
Ikramov, Kh. D., Chugunov, V. N.
openaire +2 more sources
State covariances and the matrix completion problem
52nd IEEE Conference on Decision and Control, 2013State statistics of a linear system obey certain structural constraints that arise from the underlying dynamics and the directionality of input disturbances. Herein, we formulate completion problems of partially known state statistics with the added freedom of identifying disturbance dynamics.
null Yongxin Chen +2 more
openaire +1 more source
A robust low-rank matrix completion based on truncated nuclear norm and Lp-norm
Journal of Supercomputing, 2022Hao Liang, Li Kang, Jianjun Huang
semanticscholar +1 more source
Fast Deterministic Algorithms for Matrix Completion Problems
SIAM Journal on Discrete Mathematics, 2013Ivanyos, Karpinski, and Saxena [SIAM J. Comput., 39 (2010), pp. 3736--3751] have developed a deterministic polynomial time algorithm for finding scalars $x_1, \dots, x_n$ that maximize the rank of the matrix $B_0 + x_1B_1 + \dots + x_nB_n$ for given matrices $B_0, B_1, \dots, B_n$, where $B_1, \dots, B_n$ are of rank one.
openaire +1 more source