Results 201 to 210 of about 6,034 (237)

DiSCO: deconvoluting spatial transcriptomics via combinatorial optimization with a foundational diffusion model. [PDF]

Brief Bioinform
Liu J, Wu Y, Li L.
europepmc   +1 more source

Predictive intelligence for future vibriosis risk in the eastern United States employing Bayesian spatial modeling. [PDF]

Appl Environ Microbiol
Magers BM, Kumar S, Brumfield KD, Deliz Quiñones K, Colwell RR, Jutla AS.   +5 more
europepmc   +1 more source

LLMs for industrial databases: an agro-food production plant use case. [PDF]

Front Artif Intell
Dranca L, Donate P, Sanguesa JA, Garrido P, Torres-Sanz V, Martinez FJ.   +5 more
europepmc   +1 more source

Low-Latency Marine-Based OTFS Echo Parameter Estimation Enabled by AI. [PDF]

Sensors (Basel)
Hussain K, Yoo J.
europepmc   +1 more source

Reading TEA leaves for de novo protein design

Pantolini L, Durairaj J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quantum Position Verification in the Random Oracle Model

Lecture Notes in Computer Science, 2014
We present a quantum position verification scheme in the random oracle model. In contrast to prior work, our scheme does not require bounded storage/retrieval/entanglement assumptions. We also give an efficient position-based authentication protocol.
Dominique Unruh, Unruh Dominique
exaly   +3 more sources

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.
Nicholas Spooner, Alessandro Chiesa, Chiesa Alessandro   +2 more
exaly   +3 more sources

Breaking Verifiable Delay Functions in the Random Oracle Model

Lecture Notes in Computer Science
This work resolves the open problem of whether verifiable delay functions (VDFs) can be constructed in the random oracle model.A VDF is a cryptographic primitive that requires a long time to compute (even with parallelization), but produces a unique output that is efficiently and publicly verifiable. We prove that VDFs do not exist in the random oracle
Artur Riazanov, Weiqiang Yuan, Ziyi Guan   +2 more
exaly   +3 more sources