Results 61 to 70 of about 80,492 (210)
Linear Hashing Is Awesome [PDF]
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 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 length of the longest chain is $\tilde{O}\!\left(n^{1/3}\right)$.
openaire +4 more sources
Dual-branch autoencoder network for attacking deep hashing image retrieval models
Dianxin kexue, 2023 Due to its powerful representation learning capabilities and efficient computing capabilities, deep learning-based hashing (deep hashing) methods are widely used in large-scale image retrieval.However, there are less studies on the security of deep ...
Sizheng FU +4 more
doaj +2 more sources
Enhancing Deep Hashing With GCN-Based Models for Efficient Similarity Search
IEEE AccessDeep hashing models are employed to efficiently store and swiftly search large-scale datasets where data are high dimensional. Their optimization of the loss function and the non-differentiable sign function can lead to inadequate backpropagation ...
Sooin Kim +4 more
doaj +1 more source
Hash-and-Sign with Weak Hashing Made Secure [PDF]
, 2007 Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a weak hash function by a random oracle together with another oracle allowing to break some properties of the hash function, e.g. a preimage oracle.
Sylvain Pasini, Serge Vaudenay
openaire +1 more source
An Analysis of Bitstate Hashing [PDF]
Formal Methods in System Design, 1996 The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat analysis by traditional means because of their size. Since then, the technique has been included in many research verification tools, and was even adopted in some tools that are ...
openaire +1 more source
DESIGNING THE ARCHITECTURE AND SOFTWARE COMPONENTS OF THE DOCKERISED BLOCKCHAIN MEDIATOR
Вісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технологіїSmall and medium enterprises are not adopting blockchain solutions in their supply chains and business processes due to the cost of implementing and deploying the solutions.
Pavlo Zherzherunov, Olexandr Shmatko
doaj +1 more source
Information and Control, 1984 Summary: A concept of complexity of hashing is introduced and studied with special attention to the lower bounds of complexity. A new class of rather simple hash-functions is developed. These functions are shown to be near optimal within this concept of complexity.
openaire +2 more sources
Incremental Hashing for Spin [PDF]
, 2008 This paper discusses a generalised incremental hashing scheme for explicit state model checkers. The hashing scheme has been implemented into the model checker Spin. The incremental hashing scheme works for Spin’s exhaustive and both approximate verification modes: bitstate hashing and hash compaction.
Nguyen V.Y., Ruys T.C.
openaire +2 more sources
AN ARCHITECTURAL MODEL FOR CONTENT MANAGEMENT IN E-COMMERCE APPLICATIONS USING INTELLIGENT AGENTS
Havacılık ve Uzay Teknolojileri Dergisi, 2011 In e-Commerce applications, the size of the architecture is huge and there are too many member shops and too many customers that bring along management difficulties.
Akhan Akbulut, Güray Yılmaz
doaj
Random Structures & Algorithms, 2000 AbstractWe define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and random h ∈ F, the expected value of ∣S∣ – ∣h[S]∣ is not much larger than the expectation if h had been chosen at random from the set of all functions from U to R.We give near‐optimal upper and lower bounds on the size of ...
openaire +2 more sources