Results 91 to 100 of about 129,306 (313)
Molecular Oncology, EarlyView.Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
Algorithms and literate programs for weighted low-rank approximation with missing data
, 2010 Linear models identification from data with missing values is posed as a weighted low-rank approximation problem with weights related to the missing values equal to zero.
Markovsky, Ivan, Ivan Markovsky
core +1 more source
Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays
IEEE Open Journal of Signal Processing, 2020 This paper presents a self-contained factorization for the delay Vandermonde matrix (DVM), which is the super class of the discrete Fourier transform, using sparse and companion matrices. An efficient DVM algorithm is proposed to reduce the complexity of
Sirani M. Perera +2 more
doaj +1 more source
On Pseudodeterministic Approximation Algorithms.
, 2018 We investigate the notion of pseudodeterminstic approximation algorithms. A randomized approximation algorithm A for a function f is pseudodeterministic if for every input x there is a unique value v so that A(x) outputs v with high probability, and v is a good approximation of f(x).
Peter Dixon 0002 +2 more
openaire +3 more sources
FEBS Open Bio, EarlyView.RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
Approximation Algorithms for Partially Colorable Graphs [PDF]
, 2019 Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For alpha = alpha |V| such that the graph induced on S is k-colorable.
Raychaudhury, Rahul +2 more
core +1 more source
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
Journal of Numerical Analysis and Approximation Theory, 2006 We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMSTP, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a ...
Petrică C. Pop +2 more
doaj +2 more sources
MathematicsThe goal of this manuscript is to introduce a new Stancu generalization of the modified Szász–Kantorovich operator connecting Riemann–Liouville fractional operators via Charlier polynomials.
Nadeem Rao +2 more
doaj +1 more source
Approximation algorithms for spreading points
Journal of Algorithms, 2005 We consider the problem of placing n points, each one inside its own, prespecified disk, with the objective of maximizing the distance between the closest pair of them. The disks can overlap and have different sizes. The problem is NP-hard and does not admit a PTAS. In the L∞ metric, we give a 2-approximation algorithm running in $O(n{\sqrt n}log^{2}n)$
openaire +2 more sources
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source