Results 41 to 50 of about 945,337 (242)
Hash the Universe: Differentially Private Text Extraction with Feature Hashing
Abstract Using artificial intelligence for text extraction can often require handling privacy-sensitive text. To avoid revealing confidential information, data owners and practitioners can use differential privacy, a definition of privacy with provable guarantees.
Sam Fletcher +2 more
openaire +1 more source
Methodologies for Sample Multiplexing and Computational Deconvolution in Single‐Cell Sequencing
Sample multiplexing offers a critical solution for boosting throughput and minimizing batch effects in single‐cell sequencing. This review navigates the latest experimental methodologies and computational deconvolution algorithms, bridging the gap between wet‐lab design and analytical success.
Yufei Gao, Weiwei Yin, Wei Hu, Wei Chen
wiley +1 more source
Leftover Hashing Against Quantum Side Information
The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random.
Renner, Renato +3 more
core +1 more source
Entanglement purification of unknown quantum states [PDF]
A concern has been expressed that ``the Jaynes principle can produce fake entanglement'' [R. Horodecki et al., Phys. Rev. A {\bf 59}, 1799 (1999)]. In this paper we discuss the general problem of distilling maximally entangled states from $N$ copies of a
A. K. Rajagopal +29 more
core +2 more sources
Universal classes of hash functions
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
Carter, J.Lawrence, Wegman, Mark N.
openaire +2 more sources
This paper presents a programmable metasurface‐based Meta Key Distribution (MKD) system for secure, protocol‐independent key exchange in indoor wireless settings. By embedding entropy into the wireless channel, it enables lightweight, compatible cryptographic key generation.
Xinyu Li +7 more
wiley +1 more source
Subword Semantic Hashing for Intent Classification on Small Datasets
In this paper, we introduce the use of Semantic Hashing as embedding for the task of Intent Classification and achieve state-of-the-art performance on three frequently used benchmarks.
Alonso, Pedro +8 more
core +1 more source
Universal hashing and authentication codes [PDF]
In this paper (for a preliminary version see [Lect. Notes Comput. Sci. 576, 74-85 (1992; Zbl 0789.68050)]) the author studies the applications of universal hashing to the construction of unconditionally secure authentication codes without secrecy. He generalizes the construction given by \textit{M. N. Wegman} and \textit{J. L. Carter} [J. Comput. Syst.
openaire +2 more sources
Securing Generative Artificial Intelligence with Parallel Magnetic Tunnel Junction True Randomness
True random numbers can protect generative artificial intelligence (GAI) models from attacks. A highly parallel, spin‐transfer torque magnetic tunnel junction‐based system is demonstrated that generates high‐quality, energy‐efficient random numbers.
Youwei Bao, Shuhan Yang, Hyunsoo Yang
wiley +1 more source
Postprocessing for quantum random number generators: entropy evaluation and randomness extraction
Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical ...
B. Chor +18 more
core +1 more source

