Results 201 to 210 of about 19,856 (256)

Potential Bias in Inferred Megathrust Slip Rates Induced by the Neglect of Material Heterogeneity

open access: yesGeophysical Research Letters, Volume 53, Issue 15, 16 August 2026.
Abstract Accurate knowledge of the pattern of interseismic coupling on megathrusts is critical to preparing for future earthquakes and tsunamis. However, published models for a given fault zone commonly differ widely, making hazard assessment difficult.
Jeng‐Hann Chong, Eric O. Lindsey
wiley   +1 more source

On the equivalence between classically verifiable position verification and certified randomness. [PDF]

open access: yesNat Commun
Kaleoglu F   +6 more
europepmc   +1 more source

Multi-context seeds enable fast and high-accuracy read mapping. [PDF]

open access: yesGenome Biol
Tolstoganov I   +3 more
europepmc   +1 more source

Linear hash functions

Journal of the ACM, 1999
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Noga Alon   +4 more
openaire   +2 more sources

MGR Hash Functions

Cryptologia, 2019
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi   +3 more
openaire   +1 more source

Learning to hash: forgiving hash functions and applications

Data Mining and Knowledge Discovery, 2008
The problem of efficiently finding similar items in a large corpus of high-dimensional data points arises in many real-world tasks, such as music, image, and video retrieval. Beyond the scaling difficulties that arise with lookups in large data sets, the complexity in these domains is exacerbated by an imprecise definition of similarity. In this paper,
Shumeet Baluja, Michele Covell
openaire   +1 more source

Collections of Functions for Perfect Hashing

SIAM Journal on Computing, 1986
Summary: Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance.
Francine Berman   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy