Results 111 to 120 of about 394 (158)

An optimized dynamic attribute-based searchable encryption scheme. [PDF]

PLoS One
Khan S, Khan S, Waheed A, Mehmood G, Zareei M, Alanazi F.   +5 more
europepmc   +1 more source

Two-Phase Distributed Genetic-Based Algorithm for Time-Aware Shaper Scheduling in Industrial Sensor Networks. [PDF]

Sensors (Basel)
Chang RI, Hsu TW, Chen YT.
europepmc   +1 more source

Explainable artificial intelligence for early Alzheimer's diagnosis using enhanced grey relational features and multimodal data. [PDF]

Sci Rep
Ullah W, Dai Q, Zulqarnain RM, Fiidow MA.   +3 more
europepmc   +1 more source

VeriFed: Temporally Consistent Continuous Cross-Chain Data Federation. [PDF]

Entropy (Basel)
Hao K, Bi M, Ma Y.
europepmc   +1 more source

Zero-shot prediction of drug responses using biologically informed neural networks trained on phosphoproteomic timeseries. [PDF]

PLoS Comput Biol
Antonopoulos K, Nordenstorm O, Nilsson A.   +2 more
europepmc   +1 more source

Predictors of urine toxicology and other biologic specimen missingness in randomized trials of substance use disorders. [PDF]

Drug Alcohol Depend
Kelley AT, Incze MA, Baumgartner M, Campbell ANC, Nunes EV, Scharfstein DO.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Algorithms counting monotone Boolean functions

Information Processing Letters, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Szepietowski
exaly   +3 more sources

On learning monotone Boolean functions

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 2002
We consider the problem of learning monotone Boolean functions over {0, 1}/sup n/ under the uniform distribution. Specifically, given a polynomial number of uniform random samples for an unknown monotone Boolean function f, and given polynomial completing time, we would like to approximate f as well as possible.
Avrim Blum, Carl Burch, John Langford 0001   +2 more
openaire   +1 more source