Results 71 to 80 of about 1,003,970 (287)
A Guaranteed Approximation Algorithm for QoS Anypath Routing in WMNs
Mathematics, 2022 Anypath routing is a hot research topic for QoS guarantee in wireless mesh networks (WMNs). According to time-varying characteristics of WMNs and the idea of anypath routing, a system network modeling method is proposed to address the multiple ...
Weijun Yang, Xianxian Zeng, Guanyu Lai
doaj +1 more source
, 2018 This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a product set equipped
Nouy, Anthony
core +2 more sources
Approximation algorithms for stochastic clustering
J. Mach. Learn. Res., 2018 We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including clustering which is fairer and has better long-term ...
David G. Harris 0001 +4 more
openaire +5 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
Upper and lower solution method for control of second-order Kolmogorov type systems
Journal of Numerical Analysis and Approximation TheoryIn this paper, an upper and lower solution method for the control of second-order Kolmogorov systems is introduced. Two iterative algorithms, one exact and one approximate, are proposed and their convergence is studied. The technique is based on Perov's
Alexandru Hofman
doaj +1 more source
Constrained Submodular Maximization: Beyond 1/e
, 2016 In this work, we present a new algorithm for maximizing a non-monotone submodular function subject to a general constraint. Our algorithm finds an approximate fractional solution for maximizing the multilinear extension of the function over a down-closed
Ene, Alina, Nguyen, Huy L.
core +1 more source
FEBS Open Bio, EarlyView.Chemoresistance in bladder cancer: Macrophage recruitment associated with CXCL1, CXCL5 and CXCL8 expression is characteristic of Gemcitabine/Cisplatin (Gem/Cis) Non‐Responder tumors (right side) while Responder tumors did not show substantial tumor‐stromal crosstalk (left side). All biological icons are attributed to Bioicons: carcinoma, cancerous‐cell‐
Sophie Leypold +11 more
wiley +1 more source
An ellipsoidal branch and bound algorithm for global optimization
, 2009 A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses.
Hager, William, Phan, Dzung
core +1 more source
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
Approximation algorithms for a sequencing problem with a biased bipartite structure
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 Given a family of m + 1 sets of n vertices in a metric space, a bi-level optimization problem to be considered in this paper asks to find a minimum cost repetitive walk with a prescribed terminal vertex.
Aleksandar SHURBEVSKI +2 more
doaj +1 more source