Results 11 to 20 of about 77,938 (281)
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>).
Pagh, Rasmus, Rodler, Flemming Friche
openaire +2 more sources
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
From Image Hashing to Video Hashing [PDF]
, 2010 Perceptual hashing is a technique for content identification and authentication. In this work, a frame hash based video hash construction framework is proposed. This approach reduces a video hash design to an image hash design, so that the performance of the video hash can be estimated without heavy simulation.
Weng, Li, Preneel, Bart
openaire +2 more sources
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
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
Distributed Fast Supervised Discrete Hashing
IEEE Access, 2019 Hash-based learning has attracted considerable attention due to its fast retrieval speed and low computational cost for the large-scale database. Compared with unsupervised hashing, supervised hashing achieves higher retrieval accuracy generally by ...
Zhifeng Liu, Feng Chen, Shukai Duan
doaj +1 more source
Comparative analysis of antibody- and lipid-based multiplexing methods for single-cell RNA-seq
Genome Biology, 2022 Background Multiplexing of samples in single-cell RNA-seq studies allows a significant reduction of the experimental costs, straightforward identification of doublets, increased cell throughput, and reduction of sample-specific batch effects.
Viacheslav Mylka +15 more
doaj +1 more source
Unsupervised Deep Hashing for Large-scale Visual Search [PDF]
, 2016 Learning based hashing plays a pivotal role in large-scale visual search. However, most existing hashing algorithms tend to learn shallow models that do not seek representative binary codes.
Feng, Xiaoyi +3 more
core +2 more sources
Fast and simple constant-time hashing to the BLS12-381 elliptic curve
Transactions on Cryptographic Hardware and Embedded Systems, 2019 Pairing-friendly elliptic curves in the Barreto-Lynn-Scott family are seeing a resurgence in popularity because of the recent result of Kim and Barbulescu that improves attacks against other pairing-friendly curve families.
Riad S. Wahby, Dan Boneh
doaj +1 more source
Blockchain Technology in Advertising Campaigns
Цифровая трансформация, 2023 The article is devoted to the peculiarities of blockchain technology in terms of its application in the economy. The emphasis is on the impact of this technology on the advertising market.
A. A. Efremov +2 more
doaj +1 more source