Results 191 to 200 of about 62,184 (228)
Communication Complexity of Computing the Hamming Distance [PDF]
SIAM Journal on Computing, 1986 Let \(x,y\in \{0,1\}^ n\). Persons A and B are given x and y respectively. They communicate in order that both find the Hamming distance \(d^ n_ H(x,y)\). Three communication models, viz, deterministic, \(\epsilon\)-error and \(\epsilon\)-randomized, are considered.
Abbas El Gamal
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Information Retrieval, 2002
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between objects that, most frequently, are represented as vectors. This paper considers vectors of bits. Such data structures implement entities as diverse as bitmaps that indicate the occurrences of terms and bitstrings indicating the ...
Abraham Bookstein +2 more
openaire +1 more source
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between objects that, most frequently, are represented as vectors. This paper considers vectors of bits. Such data structures implement entities as diverse as bitmaps that indicate the occurrences of terms and bitstrings indicating the ...
Abraham Bookstein +2 more
openaire +1 more source
On private Hamming distance computation
The Journal of Supercomputing, 2013Finding similarities between two datasets is an important task in many research areas, particularly those of data mining, information retrieval, cloud computing, and biometrics. However, maintaining data protection and privacy while enabling similarity measurements has become a priority for data owners in recent years.
Kok-Seng Wong, Myung Ho Kim
openaire +1 more source
On minimal Hamming compatible distances
RAIRO - Theoretical Informatics and Applications, 2014Summary: A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric and show this metric is minimal in the class of all ``well-behaved'' Hamming compatible metrics.
Parsa Bakhtary, Othman Echi
openaire +1 more source
On computing the Hamming distance
Acta Cybern., 2020Summary: Methods for the fast computation of the Hamming distance developed for the case of a large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.
Gerzson Kéri, Ákos Kisvölcsey
openaire +2 more sources
On the Hamming distance properties of group codes
IEEE Transactions on Information Theory, 1992Summary: Under certain mild conditions, the minimum Hamming distance \(D\) of an \((N,K,D)\) group code \(C\) over a non-Abelian group \(G\) is bounded by \(D\leq N-2K+2\) if \(K\leq N/2\), and is equal to 1 if \(K>N/2\).
G D Forney
exaly +3 more sources
HAMFAST: Fast Hamming Distance Computation
2009 WRI World Congress on Computer Science and Information Engineering, 2009Similarity 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 strings taken from an alphabet of m symbols. Very often binary strings, m = 2, are used.
Francesco Pappalardo 0001 +4 more
openaire +2 more sources
On the average Hamming distance for binary codes
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fangwei Fu
exaly +2 more sources
A Compressed Index for Hamming Distances
2014Some instances of multimedia data can be represented as high dimensional binary vectors under the hamming distance. The standard index used to handle queries is Locality Sensitive Hashing (LSH), reducing approximate queries to a set of exact searches.
Francisco Santoyo +2 more
openaire +1 more source
Pattern matching in the Hamming distance with thresholds
Information Processing Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mikhail J. Atallah, Timothy W. Duket
openaire +2 more sources