Results 101 to 110 of about 129,306 (313)
Approximation algorithms for rectangle stabbing and interval stabbing problems. [PDF]
Inthe weighted rectangle stabbing problem we are given a grid in R2 consisting of columns and rows each having a positive integral weight, and a set of closed axis-parallel rectangles each having a positive integral demand.
Kovaleva, S, Spieksma, Frederik
core
This work concerns the harmonization of geospatial data to improve linkages between place-based characteristics and health outcomes. Such data are typically available as geographic layers, each representing a distinct attribute (e.g., income or distance ...
Armin R. Mikler +2 more
doaj +1 more source
In this study, we developed a deep learning method for mitotic figure counting in H&E‐stained whole‐slide images and evaluated its prognostic impact in 13 external validation cohorts from seven different cancer types. Patients with more mitotic figures per mm2 had significantly worse patient outcome in all the studied cancer types except colorectal ...
Joakim Kalsnes +32 more
wiley +1 more source
ERα splice variant ERα∆7 lacks the C‐terminus, and its expression may change phenotypes of breast cancers. Our results showed that ERα∆7 is found in the luminal A subtype, and elevated ERα∆7 levels are linked to improved cell survival with lower proliferation and migration.
Long Wai Tsui +10 more
wiley +1 more source
Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials
This manuscript associates with a study of Frobenius–Euler–Simsek-type Polynomials. In this research work, we construct a new sequence of Szász–Beta type operators via Frobenius–Euler–Simsek-type Polynomials to discuss approximation properties for the ...
Nadeem Rao +2 more
doaj +1 more source
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Approximation Algorithms for Correlated Knapsack Orienteering [PDF]
We consider the correlated knapsack orienteering (CorrKO) problem: we are given a travel budget B, processing-time budget W, finite metric space (V,d) with root ρ ∈ V, where each vertex is associated with a job with possibly correlated random size and ...
Swamy, Chaitanya +1 more
core +1 more source
Improved Approximation Algorithms for Projection Games [PDF]
The projection games (aka Label-Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label-Cover.
Moshkovitz Aaronson, Dana Hadar +3 more
core +1 more source
Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane +11 more
wiley +1 more source
Better approximation guarantees for job-shop scheduling [PDF]
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee.
Paterson, Michael S. +3 more
core

