Results 111 to 120 of about 96,570 (315)
Left vs right representations for solving weighted low-rank approximation problems [PDF]
, 2007 The weighted low-rank approximation problem in general has no analytical solution in terms of the singular value decomposition and is solved numerically using optimization methods.
Markovsky, Ivan +4 more
core +1 more source
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
Low-rank matrix approximation with weights or missing data is NP-hard [PDF]
Weighted low-rank approximation (WLRA), a dimensionality reduction technique for data analysis, has been successfully used in several applications, such as in collaborative filtering to design recommender systems or in computer vision to recover ...
GILLIS, Nicolas, GLINEUR, François
core
Multivariate Approximation Theorems in Weighted Lorentz Spaces [PDF]
, 2015 We consider trigonometric polynomial approximation problems in the multivariate weighted Lorentz spaces. In particular, we prove direct and converse theorems for trigonometric approximation in the multivariate weighted Lorentz spaces with ...
Yurt, Hasan, Guven, Ali
core +1 more source
Electron transfer between complexes III and IV in S. cerevisiae mitochondrial membranes
FEBS Letters, EarlyView.Mitochondrial oxidative phosphorylation in S. cerevisiae mitoplasts is limited by complex IV catalytic capacity, rather than two‐dimensional cytochrome c diffusion. At physiological cytochrome c : supercomplex ratios at salinity equivalent to that of 20 mm monovalent salt, activity is maximized, indicating that this low ionic strength accurately mimics
Ana Paula Lobez +2 more
wiley +1 more source
Approximation algorithms for weighted matching
Theoretical Computer Science, 1987 Approximation algorithms are given for the maximum weighted matching problem in planar and other n-vertex graphs of genus ...
openaire +2 more sources
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes [PDF]
, 2005 The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka +5 more
core +1 more source
Approximation in weighted rearrangement invariant Smirnov spaces [PDF]
, 2016 In the present work,we investigate the approximation problems in weighted rearrangement invariant Smirnov spaces. We prove a direct theorem for polynomial approximation of functions in certain subclasses of weighted rearrangement invariant Smirnov ...
Jafarov, Sadulla Z
core +1 more source
Approximation of the Summation-Integral-Type q-Szász-Mirakjan Operators
Abstract and Applied Analysis, 2012 We introduce summation-integral-type q-Szász-Mirakjan operators and study approximation properties of these operators. We establish local approximation theorem. We give weighted approximation theorem.
Mei-Ying Ren, Xiao-Ming Zeng
doaj +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source