Results 41 to 50 of about 7,628 (169)
Jurnal Ilmiah Kursor: Menuju Solusi Teknologi Informasi, 2011 Abundant cases of plagiarism committed by some intellectual people in the Indonesia’s education fields have became such tragedy. Due to the amount of information which is available online are things that make copy-paste without proper citation cause ...
Diana Purwitasari +2 more
doaj +2 more sources
Online Hashing for Scalable Remote Sensing Image Retrieval
Remote Sensing, 2018 Recently, hashing-based large-scale remote sensing (RS) image retrieval has attracted much attention. Many new hashing algorithms have been developed and successfully applied to fast RS image retrieval tasks.
Peng Li +3 more
doaj +1 more source
Applied SciencesHealthcare institutions generate massive amounts of valuable patient data in the digital age. Finding the right balance between patient privacy and the demand for data-driven medical enhancements is essential.
Marios Vardalachakis +2 more
doaj +1 more source
Compressing Fisher Vector for Robust Face Recognition
IEEE Access, 2017 One major topic for robust face recognition could be the efficient encoding of facial descriptors. Among various encoders, Fisher vector (FV) is one of the probabilistic methods that yield promising results.
Hongjun Wang, Jiani Hu, Weihong Deng
doaj +1 more source
Stadium Hashing: Scalable and Flexible Hashing on GPUs [PDF]
2015 International Conference on Parallel Architecture and Compilation (PACT), 2015 Hashing is one of the most fundamental operations that provides a means for a program to obtain fast access to large amounts of data. Despite the emergence of GPUs as many-threaded general purpose processors, high performance parallel data hashing solutions for GPUs are yet to receive adequate attention.
Farzad Khorasani +3 more
openaire +1 more source
Computers & Security, 2005 It is believed that in authentication protocols where no random numbers are involved, it is hard to introduce subliminal channels. In this paper we show that subliminal channels exist in digital signature schemes where no random numbers are used. The source where the subliminal channels exist is widely acceptable hash functions with their outputs being
openaire +2 more sources
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.
Pasini, Sylvain, Vaudenay, Serge
openaire +2 more sources
Efficient computation of spaced seed hashing with block indexing
BMC Bioinformatics, 2018 Background Spaced-seeds, i.e. patterns in which some fixed positions are allowed to be wild-cards, play a crucial role in several bioinformatics applications involving substrings counting and indexing, by often providing better sensitivity with respect ...
Samuele Girotto +2 more
doaj +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
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