Results 101 to 110 of about 643,283 (231)
Deep Cross-Modal Hashing with Hashing Functions and Unified Hash Codes Jointly Learning [PDF]
arXiv, 2019 Due to their high retrieval efficiency and low storage cost, cross-modal hashing methods have attracted considerable attention. Generally, compared with shallow cross-modal hashing methods, deep cross-modal hashing methods can achieve a more satisfactory performance by integrating feature learning and hash codes optimizing into a same framework ...
arxiv
A two level minimal perfect hash function for large data sets [PDF]
Recently several minimal perfect hashing functions far small static word sets have been developed. However, they are limited to sets of 50 words or less. In this paper, a Two Level Minimal Perfect Hash Function for large data sets is given. It partitions
Barrar, Howard
core +1 more source
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions [PDF]
, 1993 Zbigniew J. Czech
openalex +1 more source
Comments on perfect hashing functions [PDF]
, 1979 Michael R. Anderson, Maija Anderson
openalex +1 more source
ENGINEERING COMPRESSED STATIC FUNCTIONS AND MINIMAL PERFECT HASH FUNCTIONS
, 2018 \emph{Static functions} are data structures meant to store arbitrary mappings from finite sets to integers; that is, given universe of items $U$, a set of $n \in \mathbb{N}$ pairs $(k_i,v_i)$ where $k_i \in S \subset U, |S|=n$, and $v_i \in \{0, 1, \ldots, m-1\} , m \in \mathbb{N} $, a static function will retrieve $v_i$ given $k_i$ (usually, in ...
openaire +3 more sources
Parallel construction of minimal perfect hashing functions with neural networks [PDF]
, 1993 Jin Wang
openalex +1 more source
GPU Exploration of Two-Player Games with Perfect Hash Functions
, 2010 Stefan Edelkamp +2 more
openalex +2 more sources
PtrHash: Minimal Perfect Hashing at RAM Throughput [PDF]
arXivGiven a set $S$ of $n$ keys, a minimal perfect hash function (MPHF) is a collision-free bijective map $\mathsf{H_{mphf}}$ from $S$ to $\{0, \dots, n-1\}$. This work presents a (minimal) perfect hash function that first prioritizes query throughput, while also allowing efficient construction for $10^9$ or more elements using 2.4 bits of memory per key.
arxiv
On the relationships between perfect nonlinear functions and universal hash families
, 2013 Jian Liu, Lusheng Chen
openalex +1 more source