loading
Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment
2015 Edition, October 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The algorithmic tasks of computing the Hamming distance between a given pattern of length m and each location in a text of length n is one of the most fundamental algorithmic tasks in string algorithms. Unfortunately, there is evidence that for a...

HAMFAST: Fast Hamming Distance Computation
2009 Edition, Volume 1, March 1, 2009 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Similarity is a vague concept which can be treated in a quantitative manner only using appropriate mathematical representation of the objects to compare and a metric on the space representation. In biology the mathematical representation of structure relies on...

Hamming Distance Computation in Unreliable Resistive Memory
Volume PP - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Enabled by new storage mediums, Computation-in- Memory is a novel architecture that has shown great potential in reducing the burden of massive data processing by bypassing the communication and memory access bottleneck. Suggested by Cassuto and Crammer, allowing for...

Hamming Distance and Normalization Circuits
2007 Edition, July 1, 2007 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The Hamming distance and normalization are important in many digital signal processing algorithms apart from multiply and multiply-accumulate operations. These operations are time consuming unless complex hardware is included, increasing power consumption and...

Iris code matching using adaptive Hamming distance
2015 Edition, October 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The most popular metric distance used in iris code matching is Hamming distance. In this paper, we improve the performance of iris code matching stage by applying adaptive Hamming distance. Proposed method works with Hamming...

Hamming-Distance-Based Binary Representation of Numbers
2018 Edition, February 1, 2018 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Numbers are represented as binary arrays in computer storage. We propose a length-n binary representation of numbers from 0 to 2n-1 based on Hamming distances such that for any i ∈ {0, ..., 2n-1}, if a constant number of bits (out of n) are flipped, the...

Hamming-Distance-Based Binary Representation of Numbers
2018 Edition, June 1, 2018 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Numbers are represented as binary arrays in computer storage. We propose a length-n binary representation of numbers from 0 to $2^{n}-1$ based on Hamming distances such that for any $i\in\{0, \ldots, 2^{n}-1\}$ , if a constant number of bits (out of n) are...

Character recognition using correlation & hamming distance
2015 Edition, May 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In this paper, character recognition is carried out using template matching scheme using correlation. In our approach, in addition to correlation, the hamming distance was applied in the scenarios where the correlation fails. In...

Learning weighted Hamming distance for binary descriptors
2013 Edition, May 1, 2013 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Local image descriptors are one of the key components in many computer vision applications. Recently, binary descriptors have received increasing interest of the community for its efficiency and low memory cost. The similarity of binary descriptors is measured by...

Binary Code Ranking with Weighted Hamming Distance
2013 Edition, June 1, 2013 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Binary hashing has been widely used for efficient similarity search due to its query and storage efficiency. In most existing binary hashing methods, the high-dimensional data are embedded into Hamming space and the distance or similarity of two points are...

Advertisement