Results 251 to 260 of about 1,728,747 (295)

Random matrix theory of rigidity in protein

Proceedings of the Symposium on Chemoinformatics, 2015
openaire   +1 more source

The Fibro-Inflammatory Ovary: Stromal Fibrosis, Extracellular Matrix Remodeling, and Mechanotransduction in Female Infertility. [PDF]

Curr Issues Mol Biol
Voros C, Chatzinikolaou F, Papadimas G, Stavros S, Papapanagiotou I, Zagorianakou N, Gunes AC, Karpouzos A, Bananis K, Tsimpoukelis C, Daskalaki MA, Makrydimas S, Thomakos N, Antsaklis P, Loutradis D, Daskalakis G.   +15 more
europepmc   +1 more source

Parametric Modeling of Cochlear Electrode Arrays Using Design of Experiments and Finite Element Analysis (FEA). [PDF]

Appl Bionics Biomech
Alaboodi AS, Alsamri J.
europepmc   +1 more source

Matrix rigidity [PDF]

Linear Algebra and Its Applications, 2000
Matrix rigidity has been introduced by \textit{L. G. Valiant} [Lect. Notes Comput. Sci. 53, 162-176 (1977; Zbl 0384.68046)] in connection with the complexity theory, namely that of proving nontrivial lower bounds on the length of computations. Valiant suggested that nonlinear lower bounds on the length of programs can be proved by constructing matrices
Bruno Codenotti
exaly   +4 more sources

On the dual rigidity matrix

Linear Algebra and Its Applications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Y Alfakih
exaly   +2 more sources

Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory [PDF]

SIAM Journal on Matrix Analysis and Applications, 2021
Nonnegative matrix factorizations are often encountered in data mining applications where they are used to explain datasets by a small number of parts. For many of these applications it is desirable that there exists a unique nonnegative matrix factorization up to trivial modifications given by scalings and permutations.
Robert Krone, Kaie Kubjas
exaly   +5 more sources

Matrix Rigidity from the Viewpoint of Parameterized Complexity [PDF]

SIAM Journal on Discrete Mathematics, 2018
Given an integer \(r>0\), the rigidity of a matrix \(A\) over a field \(\mathbb{F}\), denoted by \(\mathcal{R}^\mathbb{F}_A(r)\), is defined as the minimum Hamming distance between \(A\) and a matrix of rank at most \(r\); in other words, the minimum number of entries in \(A\) which one has to change in order to reduce its rank to at most \(r\).
Saket Saurabh, Meirav Zehavi, Fedor Fomin   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

A remark on matrix rigidity

Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann   +2 more
openaire   +1 more source