Results 91 to 100 of about 2,517,848 (305)
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj +1 more source
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
The impact of leukocyte‐associated RNA retention on platelet RNA‐based cancer detection
Platelets carry RNA signals that may help detect cancer, but platelet samples can also retain RNA from white blood cells. We found that this retained white blood cell signal did not significantly affect machine learning cancer classification, suggesting that the cancer‐related RNA signal in platelets is largely independent of leukocyte‐associated RNA ...
Michał Sieczczyński +12 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
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
Set-Valued Approximation—Revisited and Improved
We address the problem of approximating a set-valued function F, where F:[a,b]→K(Rd) given its samples {F(a+ih)}i=0N, with h=(b−a)/N. We revisit an existing method that approximates set-valued functions by interpolating signed-distance functions.
David Levin
doaj +1 more source
Special Issue on Graph Algorithms
This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source
Counting With Tinytable: Every Bit Counts!
Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source

