Results 21 to 30 of about 13,921 (252)
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
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
The intractability of computing the Hamming distance
Theoretical Computer Science, 2003 The Hamming distance of a string \(x\) to a language \(L\) is the minimum Hamming distance of \(x\) to any string in \(L\). The paper presents a number of results on the complexity of computing the Hamming distance. Namely, there exist a language in AC\(^0\) such that both Hamming distance and edit distance to this language are hard to approximate ...
Manthey, Bodo, Reischuk, Rüdiger
openaire +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
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
The communication complexity of the Hamming distance problem [PDF]
Information Processing Letters, 2006 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. We prove a quantum lower bound of Ω(d) qubits in the general interactive model with shared prior entanglement.
Wei Huang +3 more
openaire +3 more sources
Hamming index of graphs with respect to its incidence matrix
Indonesian Journal of Combinatorics, 2022 Let B(G) be the incidence matrix of a graph G. The row in B(G)corresponding to a vertex v, denoted by s(v) is the string which belongs to ℤm2, a set of m-tuples over a field of order two.
Harishchandra S. Ramane +6 more
doaj +1 more source
On Robust Colorings of Hamming-Distance Graphs [PDF]
The Electronic Journal of Combinatorics, 2018 $H_q(n,d)$ is defined as the graph with vertex set $\mathbb{Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colorings of the graphs $H_2(n,n-1)$ a notion of robustness is introduced. It is based on the tolerance
Isaiah Harney, Heide Gluesing-Luerssen
openaire +3 more sources
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
EPJ Web of ConferencesMapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source
Iraqi Journal for Mechanical and Materials Engineering, 2019 Cell Formation (CF) problem considers as the most important issue in the Cellular Manufacturing (CM) system particularly the design step. CF deals with the creation of machine cells (MCs) and part families (PFs).
Sanaa Ali Hamza, Ammar Jehad
doaj +1 more source