Results 51 to 60 of about 10,207,361 (300)
Approximation Algorithms for Maximization of k-Submodular Function Under a Matroid Constraint
Tsinghua Science and TechnologyIn this paper, we design a deterministic 1/3-approximation algorithm for the problem of maximizing non-monotone k-submodular function under a matroid constraint.
Yuezhu Liu, Yunjing Sun, Min Li
doaj +1 more source
On Application of the Ray-Shooting Method for LQR via Static-Output-Feedback
Algorithms, 2018 In this article we suggest a randomized algorithm for the LQR (Linear Quadratic Regulator) optimal-control problem via static-output-feedback. The suggested algorithm is based on the recently introduced randomized optimization method called the Ray ...
Yossi Peretz
doaj +1 more source
Efficient Asynchronous Semi-Stochastic Block Coordinate Descent Methods for Large-Scale SVD
IEEE Access, 2021 Eigenvector computation such as Singular Value Decomposition (SVD) is one of the most fundamental problems in machine learning, optimization and numerical linear algebra.
Fanhua Shang +4 more
doaj +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS Letters, EarlyView.Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
Fast and Randomized Multiple Kernel Discriminant Analysis for Bird Recognition
MathematicsIn order to improve the bird strike avoidance management at airports, and to realize the linkage of bird detection radar and a variety of bird repellent equipment, intelligent bird repellent decision methods have attracted widespread attention.
Ke Li +3 more
doaj +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
FEBS Letters, EarlyView.Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
An introduction to randomized algorithms
Discrete Applied Mathematics, 1991 The concept of randomization is known to be an extremely important tool for the design of algorithms. Its use often yields better time or space complexity compared with the best deterministic algorithms we know of for the same problem; moreover resulting randomized algorithms are often very simple to understand and implement.
openaire +1 more source
A randomized maximum-flow algorithm [PDF]
30th Annual Symposium on Foundations of Computer Science, 1989 Summary: A randomized algorithm for computing a maximum flow is presented. For an \(n\)-vertex \(m\)-edge network, the running time is \(O(nm + n^2 (\log n)^2)\) with probability at least \(1 - 2^{- \sqrt {nm}}\). The algorithm is always correct, and in the worst case runs in \(O(nm \log n)\) time.
Cheriyan, J., Hagerup, T.
openaire +2 more sources
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
A Monad for Randomized Algorithms
Electronic Notes in Theoretical Computer Science, 2016 AbstractIn this paper, we introduce a monad of random choice for domains that does not suffer from the main two drawbacks of the probabilistic powerdomain. It is not known whether any Cartesian closed category of domains is closed under the probabilistic powerdomain, but the Cartesian closed category BCD is closed under this monad of random choice ...
openaire +1 more source