Results 61 to 70 of about 742,132 (325)

Adding Edges for Maximizing Weighted Reachability

open access: yesAlgorithms, 2020
In this paper, we consider the problem of improving the reachability of a graph. We approach the problem from a graph augmentation perspective, in which a limited set size of edges is added to the graph to increase the overall number of reachable nodes ...
Federico Corò   +2 more
doaj   +1 more source

D-optimal Data Fusion: Exact and Approximation Algorithms [PDF]

open access: green, 2022
Yongchun Li   +5 more
openalex   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

Algorithms for Simultaneous Padé Approximations [PDF]

open access: yesProceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016
ISSAC ...
Nielsen, Johan S. R., Storjohann, Arne
openaire   +2 more sources

Two-Agent Pareto-Scheduling of Minimizing Total Weighted Completion Time and Total Weighted Late Work

open access: yesMathematics, 2020
We investigate the Pareto-scheduling problem with two competing agents on a single machine to minimize the total weighted completion time of agent A’s jobs and the total weighted late work of agent B’s jobs, the B-jobs having a common due date.
Yuan Zhang, Zhichao Geng, Jinjiang Yuan
doaj   +1 more source

Algorithms for ℓp Low Rank Approximation [PDF]

open access: yes, 2017
We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entry-wise ℓp-approximation error, for any P ≥ 1; the case p = 2 is the classical SVD problem.
Chierichetti, Flavio   +5 more
core  

A randomized approximate nearest neighbors algorithm [PDF]

open access: yesApplied and Computational Harmonic Analysis, 2011
We present a randomized algorithm for the approximate nearest neighbor problem in d -dimensional Euclidean space. Given N points { x j } in , the ...
Peter Wilcox, Jones   +2 more
openaire   +2 more sources

Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer

open access: yesMolecular Oncology, EarlyView.
COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann   +61 more
wiley   +1 more source

Pade Method for Construction of Numerical Algorithms for Fractional Initial Value Problem

open access: yesJournal of Mathematics, 2020
In this paper, we propose an efficient method for constructing numerical algorithms for solving the fractional initial value problem by using the Pade approximation of fractional derivative operators. We regard the Grunwald–Letnikov fractional derivative
Feng Gao, Chunmei Chi
doaj   +1 more source

Home - About - Disclaimer - Privacy