• No results found

and hashing

Protein sequence classification using feature hashing

Protein sequence classification using feature hashing

... and hashing for text classification and indexing. Hashing techniques have been also used in ...applied hashing to find the shortest contiguous subsequence that uniquely iden- tifies a DNA sequence ...

8

Password  Hashing  Competition -  Survey   and  Benchmark

Password Hashing Competition - Survey and Benchmark

... Password Hashing Competition (PHC) [10] evaluates 22 new PHSs [35] in terms of security, performance and flexibility. The candidates are: AntCrypt, Argon, battcrypt, Catena, Centrifuge, EARWORM, Gambit, Lanarea ...

30

Dynamic Multi view Hashing for Online Image Retrieval

Dynamic Multi view Hashing for Online Image Retrieval

... Advanced hashing technique is essential to facil- itate effective organization and retrieval over on- line image collections, where the contents are fre- quently ...multi-view hashing methods based on ...

7

An Extended Image Hashing Concept: Content-Based Fingerprinting Using FJLT

An Extended Image Hashing Concept: Content-Based Fingerprinting Using FJLT

... 6.1. Database and Content-Preserving Manipulations. In order to evaluate the performance of the proposed new hashing algorithms, we test FJLT hashing and RI-FJLT hashing on a database of 100 000 ...

16

Optimal Projection Guided Transfer Hashing for Image Retrieval

Optimal Projection Guided Transfer Hashing for Image Retrieval

... Transfer learning (TL) (Pan and Yang 2010), a new proposed learning conception, aims to transfer knowledge across two different domains such that rich source domain knowledge can be utilized to generate better ...

8

Providing password security by salted password hashing using Bcrypt 
		algorithm

Providing password security by salted password hashing using Bcrypt algorithm

... World Wide Web has become a popular medium to search information, business, trading and so on. Various organizations and companies are also employing the web in order to introduce their products or services around the ...

6

Unsupervised Deep Video Hashing with Balanced Rotation

Unsupervised Deep Video Hashing with Balanced Rotation

... recent hashing methods are adopted as baselines in the experiment, which are Deep Hashing (DH) [Erin Liong et ...video hashing (SubMod) [Cao et al., 2012], Spectral Hashing (SP) [Weiss et ...

7

Unsupervised Deep Video Hashing via Balanced Code for Large Scale Video Retrieval

Unsupervised Deep Video Hashing via Balanced Code for Large Scale Video Retrieval

... Temporal Hashing (SSTH), where Binary Long Short Term Memory (BLSTM) unit is designed to directly encode the video features into compact binary ...video hashing with temporal sequence modeling [19] and a ...

15

K means Clustering with Feature Hashing

K means Clustering with Feature Hashing

... Let us explain in detail. In NLP, features can be often expediently expressed with strings. For in- stance, a feature ‘the current word ends with -ing’ can be expressed as a string cur:end:ing (here we suppose : is a ...

5

The  M3dcrypt  Password  Hashing  Function

The M3dcrypt Password Hashing Function

... password hashing function F must non-trivially depend on a random auxiliary input, called salt, of sufficient length to pre- clude any precomputation of password dictionaries [17, ...

35

Compositions  of  linear  functions   and  applications  to  hashing

Compositions of linear functions and applications to hashing

... According to [5], SHA-512 hashes approximately 99 MiB/second (MiB stands for mebibyte, and 1 MiB = 2 20 bytes) and so this is roughly 10 8 bytes per second. Our proposed hash function, with p = 2 256 − 1053, hashes 10 8 ...

8

On  the (In)Security  of  IDEA  in  Various  Hashing  Modes

On the (In)Security of IDEA in Various Hashing Modes

... Abstract. In this article, we study the security of the IDEA block cipher when it is used in various simple-length or double-length hashing modes. Even though this cipher is still considered as secure, we show ...

28

Data Mining based on Hashing Technique

Data Mining based on Hashing Technique

... Abstract: Data Mining is an important aspect for any business. Most of the management level decisions are based on the process of Data Mining. One of such aspect is the association between different sale products i.e. ...

5

Optimising hashing functions with genetic algorithms

Optimising hashing functions with genetic algorithms

... Optimising Hashing Functions with Genetic Algorithms with the software I am using, which optimises by minimising the evaluation function, the performance measure is best thought of as a [r] ...

30

Security of Password Hashing in Cloud

Security of Password Hashing in Cloud

... word hashing algorithm used (SHA-256, MD5) in today and why one should use a modern hashing algorithm like Bcrypt over SHA-256 and MD5 and why should use more complex ...

24

A Retrieval Algorithm of Encrypted Speech based on Syllable-level Perceptual Hashing

A Retrieval Algorithm of Encrypted Speech based on Syllable-level Perceptual Hashing

... perceptual hashing experiments on a speech database containing 1,000 different speech segments from 863 Chinese continu- ous speech database ...perceptual hashing digest is D × M . After that, the per- ...

16

Simultaneous  hashing  of  multiple  messages

Simultaneous hashing of multiple messages

... serial hashing implementation. When hashing data from the hard-disk, the CPU performance is not the (only) limiting factor, because the disk’s read performance becomes a ...

11

Perceptual Audio Hashing Functions

Perceptual Audio Hashing Functions

... For identification purposes, we choose random parts of the records to be identified as test data (a token), and search for the object in the database where the most similar hash occurs. For speech, the tokens are chosen ...

14

TUCH:Turning Cross view Hashing into Single view Hashing via Generative Adversarial Nets

TUCH:Turning Cross view Hashing into Single view Hashing via Generative Adversarial Nets

... is hashing method that learns compact binary codes with sim- ilar binary codes for similar objects from high-dimensional ...cross-view hashing that builds isomorphic hash codes for efficient cross-view ...

7

Just  in  Time  Hashing

Just in Time Hashing

... For single-thread Argon2 an array of length m is de- clared and divided into a specified number of blocks. The first block is filled using the parameters (and optional salt) passed into the Argon2 function and the block ...

20

Show all 10000 documents...

Related subjects