Results 251 to 260 of about 435,592 (297)
Some of the next articles are maybe not open access.
Euclidean distance matrix completion problems
Optimization Methods and Software, 2012Our experiments show that the method easily solves the artificial problems introduced by More and Wu. It also solves the 12 much more difficult protein fragment problems introduced by Hendrickson, and the six larger protein problems introduced by Grooms, Lewis and Trosset.
Haw-ren Fang, D. P. O'Leary
semanticscholar +2 more sources
On a Class of Matrix Completion Problems
Mathematische Nachrichten, 1989The paper contains a unified treatment of special classes of matrix extension problems (``Schur analysis''). It is characterized as a combination of methods developed by V. P. Potapov and his collaborators in the study of the so-called fundamental matrix inequalities and of methods used by the last two authors.
V. K. Dubovoj, B. Fritzsche, B. Kirstein
semanticscholar +3 more sources
, 2020
We consider some Euclidean distance matrix completion problems whose structure is inspired by molecular conformation problems. Some matrix distances are given precisely or in terms of intervals and other values are unknown. We present theoretical results
A. D. Báez Sánchez, C. Lavor
semanticscholar +1 more source
We consider some Euclidean distance matrix completion problems whose structure is inspired by molecular conformation problems. Some matrix distances are given precisely or in terms of intervals and other values are unknown. We present theoretical results
A. D. Báez Sánchez, C. Lavor
semanticscholar +1 more source
Low Cost Sparse Network Monitoring Based on Block Matrix Completion
IEEE Conference on Computer Communications, 2021Due to high network measurement cost, network-wide monitoring faces many challenges. For a network consisting of n nodes, the cost of one time network-wide monitoring will be O(n2).
Kun Xie +4 more
semanticscholar +1 more source
The Euclidian Distance Matrix Completion Problem
SIAM Journal on Matrix Analysis and Applications, 1995Motivated by the molecular mapping (or ``conformation'') problem, i.e., the problem of deducing the possible shapes of a molecule from partial (or inaccurate) information about interatomic distances, the authors study the completions of partial Euclidean distance matrices, i.e., the choice of values for each of the unspecified entries, resulting in a ...
Bakonyi, Mihály, Johnson, Charles R.
openaire +2 more sources
The positive Q-matrix completion problem
Discrete Mathematics, Algorithms and Applications, 2015A real [Formula: see text] matrix is a [Formula: see text]-matrix if for [Formula: see text] the sum of all [Formula: see text] principal minors is positive. A digraph [Formula: see text] is said to have positive [Formula: see text]-completion if every partial positive [Formula: see text]-matrix specifying [Formula: see text] can be completed to a ...
Sarma, Bhaba Kumar, Sinha, Kalyan
openaire +1 more source
arXiv.org
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products.
Joshua Brakensiek +4 more
semanticscholar +1 more source
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products.
Joshua Brakensiek +4 more
semanticscholar +1 more source
Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,∞ Regularization
IEEE Transactions on Information Theory, 2020The analysis of nonconvex matrix completion has recently attracted much attention in the community of machine learning thanks to its computational convenience. Existing analysis on this problem, however, usually relies on $\ell _{2,\infty }$ projection
Ji Chen, Dekai Liu, Xiaodong Li
semanticscholar +1 more source