Results 21 to 30 of about 94,016 (314)
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Analysis of ...
Reinhard Kutzelnigg
doaj +1 more source
IEEE Access, 2019 With the rapid growth of multimedia data (e.g., image, audio, and video) on the Web, the learning-based hashing techniques, such as deep supervised hashing, have proven to be very efficient for large-scale multimedia search.
Zhan Yang +3 more
doaj +1 more source
Coherent parallel hashing [PDF]
Proceedings of the 2011 SIGGRAPH Asia Conference on - SA '11, 2011 Recent spatial hashing schemes hash millions of keys in parallel, compacting sparse spatial data in small hash tables while still allowing for fast access from the GPU. Unfortunately, available schemes suffer from two drawbacks: Multiple runs of the construction process are often required before success, and the random nature of the hash functions ...
García, Ismael +3 more
openaire +6 more sources
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Czech, Zbigniew J. +2 more
openaire +4 more sources
Balanced Allocations and Double Hashing [PDF]
, 2014 Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for $k=0,1,2,...$ to
Alon N. +7 more
core +1 more source
Region-DH: Region-based Deep Hashing for Multi-Instance Aware Image Retrieval [PDF]
, 2020 This paper introduces an instance-aware hashing approach Region-DH for large-scale multi-label image retrieval. The accurate object bounds can significantly increase the hashing performance of instance features.
Mtope, Franck Romuald Fotso, Wei, Bo
core +1 more source
Symbolic Representation and Learning With Hyperdimensional Computing
Frontiers in Robotics and AI, 2020 It has been proposed that machine learning techniques can benefit from symbolic representations and reasoning systems. We describe a method in which the two can be combined in a natural and direct way by use of hyperdimensional vectors and ...
Anton Mitrokhin +4 more
doaj +1 more source
BRICS Report Series, 2001 We present a simple and efficient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (<em>Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738-761, 1994</em>).
Rasmus Pagh, Flemming Friche Rodler
openaire +3 more sources
Online supervised hashing [PDF]
, 2017 Fast nearest neighbor search is becoming more and more crucial given the advent of large-scale data in many computer vision applications. Hashing approaches provide both fast search mechanisms and compact index structures to address this critical need ...
Bargal, Sarah Adel +2 more
core +1 more source
Algorithm of locality sensitive hashing bit selection based on feature selection
大数据, 2021 Locality sensitive hashing is one of the most popular information retrieval methods, which needs to generate long hashing bits to meet the retrieval requirement.However, a long hashing bits requires huge storage space, and contains plenty of redundant ...
Wenhua ZHOU, Huawen LIU, Enhui LI
doaj