Results 111 to 120 of about 36,225 (338)
Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm [PDF]
We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension.
Brams, Steven J. +2 more
core +1 more source
FEBS Open Bio, EarlyView.A tri‐culture of iPSC‐derived neurons, astrocytes, and microglia treated with ferroptosis inducers as an Induced ferroptosis model was characterized by scRNA‐seq, cell survival, and cytokine release assays. This analysis revealed diverse microglial transcriptomic changes, indicating that the system captures key aspects of the complex cellular ...
Hongmei Lisa Li +6 more
wiley +1 more source
BMI‐1 modulation and trafficking during M phase in diffuse intrinsic pontine glioma
FEBS Open Bio, EarlyView.The schematic illustrates BMI‐1 phosphorylation during M phase, which triggers its translocation from the nucleus to the cytoplasm. In cycling cells, BMI‐1 functions within the PRC1 complex to mediate H2A K119 monoubiquitination. Following PTC596‐induced M phase arrest, phosphorylated BMI‐1 dissociates from PRC1 and is exported to the cytoplasm via its
Banlanjo Umaru +6 more
wiley +1 more source
Autonomous Positioning Techniques Based on Cramér-Rao Lower Bound Analysis
EURASIP Journal on Advances in Signal Processing, 2006 We consider the problem of autonomously locating a number of asynchronous sensor nodes in a wireless network. A strong focus lies on reducing the processing resources needed to solve the relative positioning problem, an issue of great interest in ...
Urruela Andreu +3 more
doaj +1 more source
Divide and conquer in ABC: Expectation-Progagation algorithms for likelihood-free inference
, 2015 ABC algorithms are notoriously expensive in computing time, as they require simulating many complete artificial datasets from the model. We advocate in this paper a "divide and conquer" approach to ABC, where we split the likelihood into n factors, and ...
Barthelmé, Simon +2 more
core +1 more source
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions [PDF]
, 2006 A divide-and-conquer strategy based on variations of the Lipton-Tarjan planar separator theorem has been one of the most common approaches for solving planar graph problems for more than 20 years.
Bodlaender, H.L. +3 more
core
Diffusion Tractography Biomarker for Epilepsy Severity in Children With Drug‐Resistant Epilepsy
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To develop a novel deep‐learning model of clinical DWI tractography that can accurately predict the general assessment of epilepsy severity (GASE) in pediatric drug‐resistant epilepsy (DRE) and test if it can screen diverse neurocognitive impairments identified through neuropsychological assessments.
Jeong‐Won Jeong +7 more
wiley +1 more source
Divide and conquer in ABC: Expectation-Progagation algorithms for\n likelihood-free inference [PDF]
, 2015 Simon Barthelmé +2 more
openalex +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background There is growing recognition of the potential of plasma proteomics for Alzheimer's Disease (AD) risk assessment and disease characterization. However, differences between proteomics platforms introduce uncertainties regarding cross‐platform applicability.
Manyue Hu +9 more
wiley +1 more source
Where are the parallel algorithms? [PDF]
Four paradigms that can be useful in developing parallel algorithms are discussed. These include computational complexity analysis, changing the order of computation, asynchronous computation, and divide and conquer.
Voigt, R. G.
core +1 more source