Results 141 to 150 of about 95,474 (182)

Multi-Modal Feature Fusion and Hierarchical Classification for Automated Equine-Human Interaction Behavior Recognition. [PDF]

Sensors (Basel)
Arora S, Kieson E, Rudd C, Gloor PA.
europepmc   +1 more source

A scalable reinforcement learning approach for screening large peptide libraries for bioactive peptide discovery. [PDF]

Nat Commun
Pandey M, Foo J, Massah S, Alford MA, Mslati H, Subbaraj G, Saba M, Gentile F, Lallous N, Haney EF, Hancock REW, Ester M, Cherkasov A.   +12 more
europepmc   +1 more source

A drop-out mechanism for active learning based on one-attribute heuristics. [PDF]

Front Artif Intell
Ravichandran S, Sudarsanam N, Ravindran B, Katsikopoulos KV.   +3 more
europepmc   +1 more source

Penalized Variable Selection for Joint AFT Random-Effect Model With Clustered Competing-Risks Data. [PDF]

Pharm Stat
Hao L, Do Ha I.
europepmc   +1 more source

Ranking-enhanced anomaly detection using Active Learning-assisted Attention Adversarial Dual AutoEncoder. [PDF]

Sci Rep
Benabderrahmane S, Cheney J, Rahwan T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Succinct Arguments in the Quantum Random Oracle Model

Lecture Notes in Computer Science, 2019
Succinct non-interactive arguments (SNARGs) are highly efficient certificates of membership in non-deterministic languages. Constructions of SNARGs in the random oracle model are widely believed to be post-quantum secure, provided the oracle is instantiated with a suitable post-quantum hash function. No formal evidence, however, supports this belief.
Alessandro Chiesa, Peter Manohar, Nicholas Spooner   +2 more
openaire   +3 more sources

Non-Observable Quantum Random Oracle Model

Lecture Notes in Computer Science, 2023
Navid Alamati, Varun Maram, Daniel Masny
openaire   +3 more sources

The Random Oracle Model

2021
In the previous chapter we looked at dedicated forms of hash functions that we categorized as non-cryptographic hash functions. Their common denominator is that we can prove the existence of constructions that fulfill the properties (e.g., pairwise independence) without having to rely on unproven assumptions.
Arno Mittelbach, Marc Fischlin
openaire   +1 more source

Subquadratic SNARGs in the Random Oracle Model

2021
In a seminal work, Micali (FOCS 1994) gave the first succinct non-interactive argument (SNARG) in the random oracle model (ROM). The construction combines a PCP and a cryptographic commitment, and has several attractive features: it is plausibly post-quantum; it can be heuristically instantiated via lightweight cryptography; and it has a transparent ...
Alessandro Chiesa, Eylon Yogev
openaire   +1 more source