Results 81 to 90 of about 1,756,456 (179)
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once
, 2023 Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research.
Bender, Michael A. +4 more
core
Adversarial collision attacks on image hashing functions [PDF]
arXiv, 2020 Hashing images with a perceptual algorithm is a common approach to solving duplicate image detection problems. However, perceptual image hashing algorithms are differentiable, and are thus vulnerable to gradient-based adversarial attacks. We demonstrate that not only is it possible to modify an image to produce an unrelated hash, but an exact image ...
arxiv
Multi-probe consistent hashing [PDF]
arXiv, 2015 We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + epsilon with just 1 + 1/epsilon lookups per key.
arxiv
CAR:a P2P content addressable andauto-retrievable algorithm for MANET
Tongxin xuebao, 2011 To be directed at the unique features of mobile ad-hoc network（MANET） environment,a kind of mobile P2P（MP2P） index structure.Geographic-information-based hierarchical hash index structure（GH2I）,was presented based on DHT（Distributed Hash Table）.On the ...
WU Hua-feng1 +2 more
doaj +2 more sources
CPHASH: a cache-partitioned hash table
ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 2012 CPHash is a concurrent hash table for multicore processors. CPHash partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partition.
Z. Metreveli +2 more
semanticscholar +1 more source
A Quantum Algorithm To Locate Unknown Hashes For Known N-Grams Within A Large Malware Corpus
, 2020 Quantum computing has evolved quickly in recent years and is showing significant benefits in a variety of fields. Malware analysis is one of those fields that could also take advantage of quantum computing.
Allgood, Nicholas R. +1 more
core
, 2016 We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$ the expected ...
Knudsen, Mathias Bæk Tejs
core +1 more source
Parallel Heuristic Community Detection Method Based on Node Similarity
IEEE Access, 2019 Community structure discovery can help us better understand the capabilities and functions of the network. However, many existing methods have failed to identify nodes in communities accurately.
Qiang Zhou, Shi-Min Cai, Yi-Cheng Zhang
doaj +1 more source
Frequent Patterns Mining in DNA Sequence
IEEE Access, 2019 As a common biological sequence, DNA sequences contain important information. The discovery of frequent patterns in DNA sequences can help to study the evolution, function and variation of genes.
Na Deng +3 more
doaj +1 more source