Results 31 to 40 of about 447,111 (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
Strongly History-Independent Hashing with Applications
IEEE Annual Symposium on Foundations of Computer Science, 2007 We present a strongly history independent (SHI) hash table that supports search in O(l) worst-case time, and insert and delete in O(l) expected time using O(n) data space.
G. Blelloch, D. Golovin
semanticscholar +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
, 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
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Quantum key distribution (QKD) allows the generation of cryptographic keys beyond the computational hardness paradigm and is befitting for secure data transmission requiring long‐term security. The communication distance of fiber‐based QKD, however, is limited to a few hundred kilometers due to the exponential scaling of signal attenuation ...
Davide Orsucci +7 more
wiley +1 more source
A New Linear-Time Dynamic Dictionary Matching Algorithm [PDF]
, 2014 This research presents inverted lists as a new data structure for the dynamic dictionary matching algorithm. The inverted lists structure, which derives from the inverted index, is implemented by the perfect hashing table.
Boonjing, Veera, Khancome, Chouvalit
core +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
Ecology and Evolution, Volume 15, Issue 4, April 2025.A novel framework for determining the causes of mortality of large GPS‐tagged birds, the LIFE EUROKITE Assessment Protocol (LEAP), was developed. LEAP integrates GPS tracking data, site investigation, and necropsy to derive mortality causes and a corresponding certainty score. Two case studies demonstrated improvements in mortality assessments compared
Connor T. Panter +87 more
wiley +1 more source
Compact, Fast and Robust Grids for Ray Tracing
International Conference on Computer Graphics and Interactive Techniques, 2008 The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory footprint of acceleration structures now receives more attention.
Ares Lagae, P. Dutré
semanticscholar +1 more source
Parsing Millions of DNS Records Per Second
Software: Practice and Experience, Volume 55, Issue 4, Page 778-788, April 2025.ABSTRACT Objectives To enhance the throughput of DNS parsing by addressing the computational expense of processing large plain text DNS zone files. To specifically increase the speed of parsing DNS zone files compared to existing state‐of‐the‐art parsers. Method Development of a new approach named simdzone for DNS parsing.
Jeroen Koekkoek, Daniel Lemire
wiley +1 more source