Results 21 to 30 of about 452,547 (170)
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
, 2007 We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes.
A. Amir +15 more
core +4 more sources
DiBELLA: Distributed long read to long read alignment [PDF]
, 2019 We present a parallel algorithm and scalable implementation for genome analysis, specifically the problem of finding overlaps and alignments for data from "third generation" long read sequencers [29]. While long sequences of DNA offer enormous advantages
Buluç, A +4 more
core +2 more sources
GPERF : a perfect hash function generator [PDF]
, 1992 gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element ...
Schmidt, Douglas C., Suda, Tatsuya
core
Bounds for c-Ideal Hashing [PDF]
arXiv, 2023 In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideality. On the one hand, this notion generalizes the definition of perfect hashing, which has been studied extensively; on the other hand, it provides a direct link to the ...
arxiv
, 2004 We introduce two dual, purely quantum protocols: for entanglement distillation assisted by quantum communication (``mother'' protocol) and for entanglement assisted quantum communication (``father'' protocol).
Devetak, I., Harrow, A. W., Winter, A.
core +1 more source
Quarterly Journal of the Royal Meteorological Society, EarlyView.This study proposes an approach to account for the spatial and temporal variability in the contribution of surface emissivity error in the data assimilation system by including the surface emissivity as an analysis variable and representing its errors in the ensemble‐based background error covariances matrix within an idealized ensemble‐variational ...
Zheng Qi Wang, Mark Buehner, Yi Huang
wiley +1 more source
Optimal Las Vegas Locality Sensitive Data Structures
, 2017 We show that approximate similarity (near neighbour) search can be solved in high dimensions with performance matching state of the art (data independent) Locality Sensitive Hashing, but with a guarantee of no false negatives. Specifically, we give two
Ahle, Thomas Dybdahl
core +1 more source
A Genetic Algorithm for Obtaining Memory Constrained Near-Perfect Hashing [PDF]
, 2020 The problem of fast items retrieval from a fixed collection is often encountered in most computer science areas, from operating system components to databases and user interfaces. We present an approach based on hash tables that focuses on both minimizing the number of comparisons performed during the search and minimizing the total collection size ...
arxiv +1 more source
Relating quantum privacy and quantum coherence: an operational approach
, 2003 We describe how to achieve optimal entanglement generation and one-way entanglement distillation rates by coherent implementation of a class of secret key generation and secret key distillation protocols, respectively.
A. Winter, A. S. Holevo, I. Devetak
core +1 more source
Implicit Promises and the Timing of Defined‐Benefit Pension Plan Freezes
Financial Management, EarlyView.ABSTRACT Firms time defined‐benefit (DB) plan freezes after CEO turnovers to protect CEO retirement benefits from cost cuts affecting the wider workforce. We document a significant increase in voluntary CEO turnovers just before the freeze, without notable post‐freeze changes.
Zacharias Petrou, Adamos Vlittis
wiley +1 more source