Results 101 to 110 of about 1,756,456 (179)
Design, fabrication and implementation of a hash table processor [PDF]
, 1987 Hash tables have been used frequently to implement organized data table storage. However, there is a great deal of overhead in executing the hash algorithm every time the table is accessed.
Ketrick, Robert Paul
core +1 more source
Efficient end-to-end learning for quantizable representations
, 2018 Embedding representation learning via neural networks is at the core foundation of modern similarity based search. While much effort has been put in developing algorithms for learning binary hamming code representations for search efficiency, this still ...
Jeong, Yeonwoo, Song, Hyun Oh
core
Bijection: Parking-like structures and Tree-like structures [PDF]
arXiv, 2015 We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an array), if $p_i$ is occupied then $c_i$ the next available parking space (the hash table implementation using an ...
arxiv
Data-Parallel Hashing Techniques for GPU Architectures [PDF]
arXiv, 2018 Hash tables are one of the most fundamental data structures for effectively storing and accessing sparse data, with widespread usage in domains ranging from computer graphics to machine learning. This study surveys the state-of-the-art research on data-parallel hashing techniques for emerging massively-parallel, many-core GPU architectures. Key factors
arxiv
A REDUNDANCE AWARE ALGORITHM FOR THE RING PERCEPTION PROBLEM
TASK Quarterly, 1997 Following the guidelines proposed by R. Balducci and R. Pearlman [1] for an efficient exact solution of the Ring Perception Problem, a new approach based on 'prc-filtcring' technique is introduced to perceive rings in structures represented by 2 ...
GIORGIO MANCINI
doaj
The Design and Evaluation of Techniques for Route Diversity in Distributed Hash Tables [PDF]
, 2007 Cyrus Harvesf, Douglas M. Blough
openalex +1 more source
Accurate querying of frequent subgraphs in power grid graph data
Global Energy Interconnection, 2019 With the development of information technology, the amount of power grid topology data has gradually increased. Therefore, accurate querying of this data has become particularly important. Several researchers have chosen different indexing methods in the
Aihua Zhou +3 more
doaj
Authentication in stealth distributed hash tables [PDF]
, 2008 Andrew MacQuire +4 more
openalex +1 more source
Sliding Block (Slick) Hashing: An Implementation & Benchmarks [PDF]
arXivWith hash tables being one of the most used data structures, Lehmann, Sanders and Walzer propose a novel, light-weight hash table, referred to as Slick Hash. Their idea is to hit a sweet spot between space consumption and speed. Building on the theoretical ideas by the authors, an implementation and experiments are required to evaluate the practical ...
arxiv