Results 71 to 80 of about 2,298,639 (295)
Asymptotically exact streaming algorithms
We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the algorithm is restricted to polylog(n) size. Thus, the output of the algorithm is optimal in the limit.
Marc Heinrich +2 more
openaire +2 more sources
Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Exact Inference with Approximate Computation for Differentially Private Data via Perturbations
This paper discusses how two classes of approximate computation algorithms can be adapted, in a modular fashion, to achieve exact statistical inference from differentially private data products.
Ruobin Gong
doaj
Improved exact algorithms for MAX-SAT [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianer Chen, Iyad A. Kanj
openaire +3 more sources
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Exact Exploration and Hanging Algorithms [PDF]
Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sequential algorithm, there is an abstract state machine (ASM) with the same states, initial states and state transitions. That analysis, however, abstracted from details of intra-step computation, and the ASM, produced in the
Andreas Blass +2 more
openaire +2 more sources
Exact algorithms for maximum independent set [PDF]
We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of $1.
Mingyu Xiao 0001, Hiroshi Nagamochi
openaire +2 more sources
Detecting circulating tumor cells (CTCs) in blood before surgery may help predict outcomes in patients with head and neck squamous cell carcinoma (HNSCC). Here, we show when combined with tumor size and lymph node involvement from routine imaging, CTC status identifies high‐risk patients with poorer survival—offering a simple, minimally invasive tool ...
Susanne Flach +9 more
wiley +1 more source
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT [PDF]
We present improved exponential time exact algorithms for Max SAT. Our algorithms run in time of the form O(2^{(1-mu(c))n}) for instances with n variables and m=cn clauses.
Teruyama, Junichi +3 more
core +1 more source
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source

