Results 31 to 40 of about 275,015 (197)
Variational Recommendation Algorithm Based on Differential Hamming Distance [PDF]
Jisuanji kexue, 2022 Current recommendation algorithms based on hashing technology commonly uses Hamming distance to indicate the similarity between user hash code and item hash code,while it ignores the potential difference information of each bit dimension.Therefore,this ...
DONG Jia-wei, SUN Fu-zhen, WU Xiang-shuai, WU Tian-hui, WANG Shao-qing
doaj +1 more source
Search for supersymmetry in final states with jets, missing transverse momentum and one isolated lepton in √s=7 TeV pp collisions using 1 fb-1 of ATLAS data [PDF]
, 2012 We present an update of a search for supersymmetry in final states containing jets, missing transverse momentum, and one isolated electron or muon, using 1.04 fb-1 of proton-proton collision data at √s=7 TeV recorded by the ATLAS experiment at the LHC ...
Farrington, Sinead, HASH(0x5574f3d9edb8)
core +1 more source
Recursive n-gram hashing is pairwise independent, at best [PDF]
, 2010 Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values.
Carter +12 more
core +2 more sources
Methods in Ecology and Evolution, 2023 Digitalized natural history collections serve as vital ecological and evolutionary research resources. Specimen retrieval based on morphological features allows for the rapid acquisition of similar specimens from these collections, aiding in maximizing ...
Zhengyu Zhao +4 more
doaj +1 more source
Cycle-Consistent Deep Generative Hashing for Cross-Modal Retrieval
, 2018 In this paper, we propose a novel deep generative approach to cross-modal retrieval to learn hash functions in the absence of paired training samples through the cycle consistency loss.
Shao, Ling, Wang, Yang, Wu, Lin
core +1 more source
Leftover Hashing Against Quantum Side Information
, 2010 The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random.
Renner, Renato +3 more
core +1 more source
A Secure and Robust Image Hashing Scheme Using Gaussian Pyramids
Entropy, 2019 Image hash is an alternative to cryptographic hash functions for checking integrity of digital images. Compared to cryptographic hash functions, an image hash or a Perceptual Hash Function (PHF) is resilient to content preserving distortions and ...
Iram Bashir +4 more
doaj +1 more source
The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases [PDF]
, 2009 In this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits.
Akinwale, A. T., Ibharalu, F. T.
core +1 more source
FSH: fast spaced seed hashing exploiting adjacent hashes [PDF]
Algorithms for Molecular Biology, 2018 Patterns with wildcards in specified positions, namely spaced seeds, are increasingly used instead of k-mers in many bioinformatics applications that require indexing, querying and rapid similarity search, as they can provide better sensitivity. Many of these applications require to compute the hashing of each position in the input sequences with ...
Girotto, Samuele +2 more
openaire +3 more sources
Hashing for Similarity Search: A Survey [PDF]
, 2014 Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database.
Ji, Jianqiu +3 more
core