Results 21 to 30 of about 245,617 (365)

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration [PDF]

open access: yesACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2019
As data analytics becomes more crucial to digital systems, so grows the importance of characterizing the database queries that admit a more efficient evaluation.
Nofar Carmeli   +4 more
semanticscholar   +1 more source

Enumerating Finitary Processes. [PDF]

open access: yesEntropy (Basel)
We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of ϵ-machines. We characterize ϵ-machines in the language of automata theory and adapt a recent algorithm for generating accessible deterministic finite automata, pruning this over-large class down to that of ϵ-machines. As an application,
Johnson BD   +3 more
europepmc   +6 more sources

Simultaneous enumeration of cancer and immune cell types from bulk tumor gene expression data

open access: yesbioRxiv, 2017
Immune cells infiltrating tumors can have important impact on tumor progression and response to therapy. We present an efficient algorithm to simultaneously estimate the fraction of cancer and immune cell types from bulk tumor gene expression data.
Julien Racle   +4 more
semanticscholar   +1 more source

Enumerating homomorphisms

open access: yesJournal of Computer and System Sciences, 2012
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints ...
Bulatov, Andrei A.   +3 more
openaire   +6 more sources

A new medium for the enumeration and subculture of bacteria from potable water

open access: yesApplied and Environmental Microbiology, 1985
Plate count agar is presently the recommended medium for the standard bacterial plate count (35 degrees C, 48-h incubation) of water and wastewater. However, plate count agar does not permit the growth of many bacteria that may be present in treated ...
D. Reasoner, E. Geldreich
semanticscholar   +1 more source

Numeration and enumeration

open access: yesEuropean Journal of Combinatorics, 2012
AbstractIn this paper, numeration systems defined by recurrent sequences are considered. We present a class of recurrences yielding numeration systems for which the words corresponding to greedy expressions for natural numbers are easily described. Those sequences, in turn, enumerate classes of words with forbidden substrings.
MEROLA, FRANCESCA, DANIELE A. GEWURZ
openaire   +2 more sources

Water, modern and multiple: Enriching the idea of water through enumeration amidst a water crisis in Bengaluru

open access: yesWater Alternatives, 2021
Numeric abstractions relied upon by modern water management are reductive by design, but their political effects need not be reductionist, as an example from Bengaluru attests.
Lindsay Vogt
doaj  

Isolation of probiotics and nutritional evaluation of fermented lactose-free foods as a potential treatment for diarrhoea

open access: yesCroatian Journal of Food Science and Technology, 2021
Probiotics are live bacteria that can be found in fermented local foods and confer health benefits on the host when administered in adequate amounts. However, there is little awareness of local fermented, lactose-free foods as good and cheap sources of ...
Dupe Temilade Otolowo   +4 more
doaj   +1 more source

Skeletal program enumeration for rigorous compiler testing [PDF]

open access: yesACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2016
A program can be viewed as a syntactic structure P (syntactic skeleton) parameterized by a collection of identifiers V (variable names). This paper introduces the skeletal program enumeration (SPE) problem: Given a syntactic skeleton P and a set of ...
Qirun Zhang, Chengnian Sun, Z. Su
semanticscholar   +1 more source

Bimonotone enumeration [PDF]

open access: yesMathematics of Computation, 2009
Solutions of a diophantine equation $f(a,b) = g(c,d)$, with $a,b,c,d$ in some finite range, can be efficiently enumerated by sorting the values of $f$ and $g$ in ascending order and searching for collisions. This article considers functions that are bimonotone in the sense that $f(a,b) \le f(a',b')$ whenever $a \le a'$ and $b \le b'$.
openaire   +4 more sources

Home - About - Disclaimer - Privacy