Results 31 to 40 of about 8,109 (197)

The matching relaxation for a class of generalized set partitioning problems

open access: yes, 2018
This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints.
Cavalcante, Evellyn   +3 more
core  

Partial resampling to approximate covering integer programs

open access: yes, 2020
We consider column-sparse covering integer programs, a generalization of set cover, which have a long line of research of (randomized) approximation algorithms.
Chen, Antares   +2 more
core  

Hamilton cycles in graphs and hypergraphs: an extremal perspective [PDF]

open access: yes, 2014
As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Recent developments in the area have highlighted the crucial role played by the notions of expansion and quasi ...
Kühn, Daniela, Osthus, Deryk
core   +1 more source

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

open access: yesFEBS Open Bio, EarlyView.
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li   +8 more
wiley   +1 more source

Embedding large subgraphs into dense graphs

open access: yes, 2009
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core   +1 more source

Development of a Prediction Model for Progression Risk in High‐Grade Gliomas Based on Habitat Radiomics and Pathomics

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To investigate the value of constructing models based on habitat radiomics and pathomics for predicting the risk of progression in high‐grade gliomas. Methods This study conducted a retrospective analysis of preoperative magnetic resonance (MR) images and pathological sections from 72 patients diagnosed with high‐grade gliomas (52 ...
Yuchen Zhu   +14 more
wiley   +1 more source

Unraveling the Molecular Mechanisms of Glioma Recurrence: A Study Integrating Single‐Cell and Spatial Transcriptomics

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Glioma recurrence severely impacts patient prognosis, with current treatments showing limited efficacy. Traditional methods struggle to analyze recurrence mechanisms due to challenges in assessing tumor heterogeneity, spatial dynamics, and gene networks.
Lei Qiu   +10 more
wiley   +1 more source

Entropy of random coverings and 4D quantum gravity

open access: yes, 1994
We discuss the counting of minimal geodesic ball coverings of $n$-dimensional riemannian manifolds of bounded geometry, fixed Euler characteristic and Reidemeister torsion in a given representation of the fundamental group.
A. Marzuoli   +75 more
core   +2 more sources

Diffusion Spectrum Imaging Maps Early Axonal Loss and a Unique Progressive Signal in Neuronal Intranuclear Inclusion Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang   +10 more
wiley   +1 more source

Survey on Combinatorial Register Allocation and Instruction Scheduling

open access: yes, 2018
Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler.
Lozano, Roberto Castañeda   +1 more
core  

Home - About - Disclaimer - Privacy