Results 11 to 20 of about 62,184 (228)
The hamming distance in the minority game [PDF]
Physica A: Statistical Mechanics and its Applications, 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 make decisions is introduced as an analytical tool to determine several ...
B. Arthur +4 more
core +7 more sources
Competition of Languages and their Hamming Distance [PDF]
International Journal of Modern Physics C, 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.
Meyer-Ortmanns, Hildegard +1 more
core +2 more sources
The Communication Complexity of the Hamming Distance Problem [PDF]
Information Processing Letters, 2005 We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d.
Ambainis +13 more
core +3 more sources
Compressed Communication Complexity of Hamming Distance
Algorithms, 2021 We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a ...
Shiori Mitsuya +4 more
doaj +3 more sources
Approximate Hamming distance in a stream [PDF]
CoRR, 2016 We consider the problem of computing a $(1+ε)$-approximation of the Hamming distance between a pattern of length $n$ and successive substrings of a stream. We first look at the one-way randomised communication complexity of this problem, giving Alice the first half of the stream and Bob the second half.
Raphaël Clifford, Tatiana Starikovskaya
openaire +4 more sources
Approximating text-to-pattern Hamming distances [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 We revisit a fundamental problem in string matching: given a pattern of length m and a text of length n, both over an alphabet of size $σ$, compute the Hamming distance between the pattern and the text at every location. Several $(1+ε)$-approximation algorithms have been proposed in the literature, with running time of the form $O(ε^{-O(1)}n\log n\log ...
Timothy M. Chan +4 more
openaire +2 more sources
On the $k$-Hamming and $k$-Edit Distances [PDF]
CoRR, 2023 In this paper we consider the weighted $k$-Hamming and $k$-Edit distances, that are natural generalizations of the classical Hamming and Edit distances. As main results of this paper we prove that for any $k\geq 2$ the DECIS-$k$-Hamming problem is $\mathbb{P}$-SPACE-complete and the DECIS-$k$-Edit problem is NEXPTIME-complete.
Chiara Epifanio +5 more
openaire +3 more sources
Hamming Distance and the onset of quantum criticality [PDF]
Physical Review B, 2021 Abstract Simulating models for quantum correlated matter unveils the inherent limitations of deterministic classical computations. In particular, in the case of quantum Monte Carlo methods, this is manifested by the emergence of negative weight configurations in the sampling, that is, the sign problem (SP).
Tian-Cheng Yi +2 more
openaire +2 more sources
Fast and Compact Hamming Distance Index [PDF]
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016 Searching for similar objects in a collection is a core task of many applications in databases, pattern recognition, and information retrieval. As there exist similarity-preserving hash functions like SimHash, indexing these objects reduces to the solution of the Approximate Dictionary Queries problem.
Gog, Simon, VENTURINI, ROSSANO
openaire +5 more sources