Results 11 to 20 of about 74,857 (256)
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
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
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
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 ...
Chan, Timothy M. +4 more
openaire +2 more sources
Finding Approximate Repetitions under Hamming Distance [PDF]
Theoretical Computer Science, 2001 The problem of computing tandem repetitions with $K$ possible mismatches is studied. Two main definitions are considered, and for both of them an $O(nK\log K+S)$ algorithm is proposed ($S$ the size of the output). This improves, in particular, the bound obtained in \cite{LS93}.
Kolpakov, Roman, Kucherov, Gregory
openaire +5 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
k-Approximate Quasiperiodicity Under Hamming and Edit Distance [PDF]
Algorithmica, 2021 AbstractQuasiperiodicity in strings was introduced almost 30 years ago as an extension of string periodicity. The basic notions of quasiperiodicity are cover and seed. A cover of a text T is a string whose occurrences in T cover all positions of T. A seed of text T is a cover of a superstring of T.
Aleksander Kędzierski +1 more
openaire +5 more sources
Detecting Fabricated Interviews Using the Hamming Distance
Survey Research Methods, 2023 In the research literature on survey methodology, there is considerable discussion of interviewer effects and how to prevent data fabrication; however, there is little discussion on the detection of data fabrication by interviewers in published data ...
Jörg Blasius, Lukas Sausen
doaj +1 more source
Some Connections Between Classical Coding and Network Coding Over Erroneous Cyclic Networks
IEEE Access, 2016 Recently, a framework was given for linear error-correcting network codes (LENCs) over cyclic networks on commutative rings. When the alphabet is considered as a rational power series ring, an LENC is referred to as a convolutional error-correcting ...
Vahid Samadi-Khaftari +2 more
doaj +1 more source