Results 61 to 70 of about 18,476 (288)

Updates on Properties of Hamming Distance of Binary Fuzzy Codes over Fuzzy Vector Spaces and Their Application in Decoding Process

open access: yesFuzzy Information and Engineering, 2023
In this paper, we used the definition of fuzzy vector spaces and fuzzy subsets in combination in order to define fuzzy codes over a fuzzy vector space.
Mezgebu Manmekto Gereme   +2 more
doaj   +1 more source

On the Hamming distance of constraint satisfaction problems

open access: yesTheoretical Computer Science, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierluigi Crescenzi, Gianluca Rossi
openaire   +3 more sources

Matching Patterns with Variables under Hamming Distance

open access: yesCoRR, 2021
A pattern $α$ is a string of variables and terminal letters. We say that $α$ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $α$ by terminal words. The matching problem, i.e., deciding whether a given pattern matches a given word, was heavily investigated: it is NP-complete in general, but ...
Pawel Gawrychowski   +2 more
openaire   +4 more sources

02Hamming1995March30.FoundationsOfDigitalRevolution [PDF]

open access: yes, 1995
"The Art of Doing Science and Engineering: Learning to Learn" was the capstone course by Dr. Richard W. Hamming (1915-1998) for graduate students at the Naval Postgraduate School (NPS) in Monterey California.
Hamming, Richard W.
core  

Gravity‐Dependent Modulation of Downbeat Nystagmus: Insights From Velocity‐Storage Dysfunction

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Downbeat nystagmus varies with head position, a phenomenon termed gravity‐dependent modulation. We aimed to clarify its mechanism using a velocity‐storage model. Methods In 10 patients with downbeat nystagmus due to cerebellar disorders, we recorded eye movements at different pitch‐ and roll‐axis head positions.
Ji‐Hyung Park   +5 more
wiley   +1 more source

Iris code matching using adaptive Hamming distance [PDF]

open access: yes, 2016
The most popular metric distance used in iris code matching is Hamming distance. In this paper, we improve the performance of iris code matching stage by applying adaptive Hamming distance. Proposed method works with Hamming subsets with adaptive length.
Dehkordi, A. B., Abu-Bakar, S. A. R.
core  

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT [PDF]

open access: yes, 2019
X3SAT is the problem of whether one can satisfy a given set of clauses with up to three literals such that in every clause, exactly one literal is true and the others are false.
Jain, Sanjay   +2 more
core   +1 more source

Solution‐Processed Two‐Dimensional Indium Oxide on Sodium‐Embedded Alumina for Reconfigurable Optoelectronic Synaptic Transistors

open access: yesAdvanced Functional Materials, EarlyView.
Wafer‐scale two‐dimensioanl In2Se3 oxidized into InOx on sodium‐embedded beta‐alumina enables multifunctional reconfigurable electronics. Sodium ions accumulate within distinct spatial distribution under drain‐controlle and gate‐controlled operation. Drain‐control operation gives controllability of ultraviolet‐driven optoelectronic synaptic conductance
Jinhong Min   +13 more
wiley   +1 more source

Calculating Hamming Distance with the IBM Q Experience [PDF]

open access: yes, 2018
In this brief paper a quantum algorithm to calculate the Hamming distance of two binary strings of equal length (or messages in theory information) is presented. The algorithm calculates the Hamming weight of two binary strings in one query of an oracle.
José Manuel Bravo
core   +3 more sources

One-Sided Error Communication Complexity of Gap Hamming Distance [PDF]

open access: yes, 2018
Assume that Alice has a binary string x and Bob a binary string y, both strings are of length n. Their goal is to output 0, if x and y are at least L-close in Hamming distance, and output 1, if x and y are at least U-far in Hamming distance, where L < U ...
Klenin, Egor, Kozachinskiy, Alexander
core   +1 more source

Home - About - Disclaimer - Privacy