Results 51 to 60 of about 1,007,914 (329)
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
, 2017 We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms.
Chalermsook, Parinya +6 more
core +1 more source
Peroxidasin enables melanoma immune escape by inhibiting natural killer cell cytotoxicity
Molecular Oncology, EarlyView.Peroxidasin (PXDN) is secreted by melanoma cells and binds the NK cell receptor NKG2D, thereby suppressing NK cell activation and cytotoxicity. PXDN depletion restores NKG2D signaling and enables effective NK cell–mediated melanoma killing. These findings identify PXDN as a previously unrecognized immune evasion factor and a potential target to improve
Hsu‐Min Sung +17 more
wiley +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
Algorithms For Positive Polynomial Approximation [PDF]
SIAM Journal on Numerical Analysis, 2019 Summary: We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions. Our method is based on the special representations
Charles, Frédérique +2 more
openaire +2 more sources
Molecular Oncology, EarlyView.This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris +10 more
wiley +1 more source
Approximation of Queues in Bike-Sharing Systems With Finite Docks
Promet (Zagreb)This paper presents a closed queuing network model to address bike queues in bike-sharing systems with finite docks. The model tackles issues of bike spillover and user attrition due to fully occupied docks and bike shortages at stations.
Xiang PENG, Jingyan WANG, Yong ZHANG
doaj +1 more source
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems [PDF]
, 2012 We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixed-
Magnanti, Thomas L., Stratila, Dan
core +2 more sources
Almost-Tight Distributed Minimum Cut Algorithms
, 2014 We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter.
A. Das Sarma +13 more
core +1 more source
Tumor mutational burden as a determinant of metastatic dissemination patterns
Molecular Oncology, EarlyView.This study performed a comprehensive analysis of genomic data to elucidate whether metastasis in certain organs share genetic characteristics regardless of cancer type. No robust mutational patterns were identified across different metastatic locations and cancer types.
Eduardo Candeal +4 more
wiley +1 more source
Adaptive variational discretization approximation method for parabolic optimal control problems
Journal of Inequalities and Applications, 2020 In this paper, we study variational discretization method for parabolic optimization problems. Firstly, we obtain some convergence and superconvergence analysis results of the approximation scheme.
Yuelong Tang, Yuchun Hua
doaj +1 more source