Results 81 to 90 of about 1,098,148 (248)

Hybrid Classical–Quantum Text Search Based on Hashing

open access: yesMathematics
The paper considers the problem of finding a given substring in a text. It is known that the complexity of a classical search query in an unordered database is linear in the length of the text and a given substring.
Farid Ablayev   +2 more
doaj   +1 more source

Tabulation Based 5-Universal Hashing and Linear Probing

open access: yesWorkshop on Algorithm Engineering and Experimentation, 2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold improvement in speed over direct methods based on degree 3 polynomials.
M. Thorup, Yin Zhang
semanticscholar   +1 more source

HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields [PDF]

open access: yesarXiv, 2021
HalftimeHash is a new algorithm for hashing long strings. The goals are few collisions (different inputs that produce identical output hash values) and high performance. Compared to the fastest universal hash functions on long strings (clhash and UMASH) HalftimeHash decreases collision probability while also increasing performance by over 50 ...
arxiv  

Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2 [PDF]

open access: yesIEEE Transactions on Information Theory, Volume 62, Issue 6, 3451 - 3476 (2016), 2013
Recently, $\varepsilon$-almost dual universal$_2$ hash functions has been proposed as a new and wider class of hash functions. Using this class of hash functions, several efficient hash functions were proposed. This paper evaluates the security performance when we apply this kind of hash functions.
arxiv   +1 more source

Cellodextrin Metabolism and Phosphotransferase System‐Catalyzed Uptake in Enterococcus faecalis

open access: yesMolecular Microbiology, EarlyView.
In an infectious context, β‐glucoside metabolism is highly induced in Enterococcus faecalis. Our work demonstrates that this bacterium possesses a network of multiple PTS transporters dedicated to the transport of cellobiose and cellodextrins. The genes encoding the proteins involved in this metabolism are clustered within a single locus in the E ...
Victor Combret   +8 more
wiley   +1 more source

On Symmetric and Asymmetric LSHs for Inner Product Search [PDF]

open access: yes, 2015
We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context.
Neyshabur, Behnam, Srebro, Nathan
core  

Training Logistic Regression and SVM on 200GB Data Using b-Bit Minwise Hashing and Comparisons with Vowpal Wabbit (VW) [PDF]

open access: yesarXiv, 2011
We generated a dataset of 200 GB with 10^9 features, to test our recent b-bit minwise hashing algorithms for training very large-scale logistic regression and SVM. The results confirm our prior work that, compared with the VW hashing algorithm (which has the same variance as random projections), b-bit minwise hashing is substantially more accurate at ...
arxiv  

Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search

open access: yes, 2018
The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\mathcal{H}$ over locality-sensitive hash functions ...
A Andoni   +12 more
core   +1 more source

Finding the Words: How Does the Aging Brain Process Language? A Focused Review of Brain Connectivity and Compensatory Pathways

open access: yesTopics in Cognitive Science, EarlyView.
Abstract As people age, there is a natural decline in cognitive functioning and brain structure. However, the relationship between brain function and cognition in older adults is neither straightforward nor uniform. Instead, it is complex, influenced by multiple factors, and can vary considerably from one person to another.
Monica Baciu, Elise Roger
wiley   +1 more source

Quantum Period Finding is Compression Robust

open access: yes, 2021
We study quantum period finding algorithms such as Simon and Shor (and its variants Eker{\aa}-H{\aa}stad and Mosca-Ekert). For a periodic function $f$ these algorithms produce -- via some quantum embedding of $f$ -- a quantum superposition $\sum_x |x ...
May, Alexander, Schlieper, Lars
core  

Home - About - Disclaimer - Privacy