Results 81 to 90 of about 561,904 (322)

Array Structures and Data-Parallel Algorithms

, 1996
. We integrate the semantics of higher-order functional programs with a notion of explicit static processes as used in BSP and PRAM algorithms. The result is the construction of a cartesian closed category (CCC), a model for typed functional languages.
John Mullins, Gaétan Hains, Hains, Gaétan, Mullins, John   +3 more
core   +2 more sources

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries [PDF]

Logical Methods in Computer Science
We study the enumeration of answers to Unions of Conjunctive Queries (UCQs) with optimal time guarantees. More precisely, we wish to identify the queries that can be solved with linear preprocessing time and constant delay.
Karl Bringmann, Nofar Carmeli
doaj   +1 more source

Patient therapy outcome modeling in cancer organoids is improved by cancer‐associated fibroblasts and organoid assembly convolution

Molecular Oncology, EarlyView.
Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski, Liudmyla Dolinchuk, Michał Jerzak, Albert Gandurski, Tomasz Grochowski, Weronika Wojtyś, Maciej Zadrożny, Wojciech Kaźmierczak, Małgorzata Lenarcik, Marta Matejak‐Górska, Radosław Samsel, Tomasz Olesiński, Dawid Walerych   +12 more
wiley   +1 more source

PPSZ is better than you think [PDF]

TheoretiCS
PPSZ, for long time the fastest known algorithm for $k$-SAT, works by going through the variables of the input formula in random order; each variable is then set randomly to $0$ or $1$, unless the correct value can be inferred by an efficiently ...
Dominik Scheder
doaj   +1 more source

Epigenetic heterogeneity and plasticity in therapy‐induced tumor states through single‐cell multi‐omics

Molecular Oncology, EarlyView.
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, Hwiyeong Lee, Jin Hong, Daechan Park   +3 more
wiley   +1 more source

A mathematical theory of synchronous concurrent algorithms [PDF]

, 1987
A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock.
Thompson, B.C, Thompson, Benjamin Criveli   +1 more
core  

On the Constant-Depth Circuit Complexity of Generating Quasigroups [PDF]

TheoretiCS
We investigate the constant-depth circuit complexity of the Isomorphism Problem, Minimum Generating Set Problem (MGS), and Sub(quasi)group Membership Problem (Membership) for groups and quasigroups (=Latin squares), given as input in terms of their ...
Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß   +3 more
doaj   +1 more source

ZW4864‐mediated inhibition of the β‐catenin/BCL9/BCL9L complex reveals therapeutic potential in bladder cancer

Molecular Oncology, EarlyView.
BCL9 and BCL9L drive bladder cancer progression by enhancing β‐catenin signaling, promoting proliferation, migration, invasion, and organoid growth. Genetic depletion of BCL9(L) suppresses malignant phenotypes, while pharmacological disruption of the β‐catenin/BCL9(L) complex with ZW4864 inhibits canonical Wnt signaling and tumor‐associated cellular ...
Roland Kotolloshi, Mandy Berndt‐Paetz, Eileen Lerner, Gregoire Najjar, Anca Azoitei, Krishna Pal Singh, Shailendra Kumar Gupta, Olaf Wolkenhauer, Cagatay Günes, Otmar Huber, Marc‐Oliver Grimm, Daniel Steinbach   +11 more
wiley   +1 more source

Digital Access to Comparison-Based Tree Data

, 2007
This paper presents a simple method to build tree data structures which achieve just O(log N) visited nodes and O(D) compared digits (bits or bytes) per search or update, where N is the number of keys and D is the length of the keys, irrespectively of
Salvador Roura, Structures And Algorithms   +1 more
core  

Lock-free Data Structures for Data Stream Processing

, 2019
The ever-growing amounts of data in the digital world require more and more computing power to meet the requirements. Especially in the area of social media, sensor data processing or Internet of Things, the data need to be handled on the fly during its ...
Baumstark, Alexander
core   +1 more source