Results 1  10
of
1,425
The Hamming Distance in the . . .
, 1999
"... We investigate different versions of the minority game, a toy model for agents buying and selling a commodity. The Hamming distance between the strategies used by agents to take decisions is introduced as an analytical tool to determine several properties of these models. The success rate of the age ..."
Abstract
 Add to MetaCart
We investigate different versions of the minority game, a toy model for agents buying and selling a commodity. The Hamming distance between the strategies used by agents to take decisions is introduced as an analytical tool to determine several properties of these models. The success rate
The Intractability of Computing the Hamming Distance
, 2002
"... Given a language L, the Hamming distance of a string x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a given language is defined similarly. First, ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Given a language L, the Hamming distance of a string x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a given language is defined similarly. First,
The Information Complexity of Hamming Distance
"... The Hamming distance function Hamn,d returns 1 on all pairs of inputs x and y that dier in at most d coordinates and returns 0 otherwise. We initiate the study of the information complexity of the Hamming distance function. We give a new optimal lower bound for the information complexity of the Hamn ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Hamming distance function Hamn,d returns 1 on all pairs of inputs x and y that dier in at most d coordinates and returns 0 otherwise. We initiate the study of the information complexity of the Hamming distance function. We give a new optimal lower bound for the information complexity
Competition of Languages and their Hamming Distance
, 2005
"... We consider the spreading and competition of languages that are spoken by a population of individuals. The individuals can change their mother tongue during their lifespan, pass on their language to their offspring and finally die. The languages are described by bitstrings, their mutual difference i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
is expressed in terms of their Hamming distance. Language evolution is determined by mutation and adaptation rates. In particular we consider the case where the replacement of a language by another one is determined by their mutual Hamming distance. As a function of the mutation rate we find a sharp transition
Hamming Distance for Conjugates
, 2008
"... Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y
The Hamming Distance in the Minority Game
, 1999
"... We investigate different versions of the minority game, a toy model for agents buying and selling a commodity. The Hamming distance between the strategies used by agents to take decisions is introduced as an analytical tool to determine several properties of these models. The success rate of the age ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We investigate different versions of the minority game, a toy model for agents buying and selling a commodity. The Hamming distance between the strategies used by agents to take decisions is introduced as an analytical tool to determine several properties of these models. The success rate
Communication complexity of the Hamming distance
"... 47.31> C(dn) up to one bit if q = 2. This result was later extended by Ahlswede [1] to alphabet sizes q = 4; 5. So for q = 2; 4; 5 and all n 1 j C(dn) \Gamma dn \Delta log2(q)e \Gamma dlog2 (n + 1)e j 1: (2) In order to prove (2) a lower bound using constant distance code pairs was applied. In ..."
Abstract
 Add to MetaCart
. In [4] the rank lower bound (1) was used to prove that (2) holds for all q and the special parameters n = p m \Gamma 1; m 1, where p is a prime factor of q. The matrices fMk (dn)g n k=0 of the Hamming distance just form the Ham
Hamming Distance Metric Learning
"... Motivated by largescale multimedia applications we propose to learn mappings from highdimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to largescale applications as they are storage efficient and permit exact sublinear kNN search. The framework is ..."
Abstract

Cited by 36 (3 self)
 Add to MetaCart
Motivated by largescale multimedia applications we propose to learn mappings from highdimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to largescale applications as they are storage efficient and permit exact sublinear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We overcome discontinuous optimization of the discrete mappings by minimizing a piecewisesmooth upper bound on empirical loss, inspired by latent structural SVMs. We develop a new lossaugmented inference algorithm that is quadratic in the code length. We show strong retrieval performance on CIFAR10 and MNIST, with promising classification results using no more than kNN on the binary codes. 1
The communication complexity of the Hamming Distance Problem
 Information Processing Letters
"... We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two nbit strings is no less than a threshold d. We prove a quantum lower bound of Ω(d) qubits in the general interactive model with shared prior ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two nbit strings is no less than a threshold d. We prove a quantum lower bound of Ω(d) qubits in the general interactive model with shared prior
The Communication Complexity of Gap Hamming Distance
, 2012
"... In the gap Hamming distance problem, two parties must determine whether their respective strings x,y ∈ {0,1} n are at Hamming distance less than n/2 − √ n or greater than n/2 + √ n. In a recent tour de force, Chakrabarti and Regev (2010) proved the longconjectured Ω(n) lower bound on the randomize ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
In the gap Hamming distance problem, two parties must determine whether their respective strings x,y ∈ {0,1} n are at Hamming distance less than n/2 − √ n or greater than n/2 + √ n. In a recent tour de force, Chakrabarti and Regev (2010) proved the longconjectured Ω(n) lower bound
Results 1  10
of
1,425