Results 211 to 220 of about 6,485 (259)

Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. [PDF]

PLoS One
Andreev A, Kochemazov S, Semenov A.
europepmc   +1 more source

On distance, similarity and entropy measures of multidimensional fuzzy sets. [PDF]

Sci Rep
Josen J, John SJ, Vallikavungal J.
europepmc   +1 more source

A Stacked Ensemble Multi-Label Model for Predicting Co-Occurring Microvascular and Macrovascular Complications in Type 2 Diabetes. [PDF]

Chronic Dis Transl Med
Zamani M, Farhadian M, Piran N, Borzouei S.   +3 more
europepmc   +1 more source

Fractal memory structure in the spatiotemporal learning rule. [PDF]

Front Comput Neurosci
Orima T, Tsuda I, Tsukada M, Tsukada H, Horio Y.   +4 more
europepmc   +1 more source

A novel transformer-based semantic feature extraction method for multi-label text classification. [PDF]

Sci Rep
Xiao L, Zhang J.
europepmc   +1 more source

A Low-Cost Passive Acoustic Toolkit for Underwater Recordings. [PDF]

Sensors (Basel)
Galanos V, Galanos V, Trygonis V, Mazaris AD, Katsanevakis S.   +4 more
europepmc   +1 more source

Bounds on relative generalised Hamming weight [PDF]

IET Communications, 2020
The r th relative generalised Hamming weight (RGHW) of an linear code C and an subcode , a generalisation of generalised Hamming ...
Zhuojun Zhuang, Bin Dai
exaly   +2 more sources

Analysis of Low Hamming Weight Products

Discrete Applied Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jung Hee Cheon, HongTae Kim
exaly   +2 more sources

A hybrid implementation of Hamming weight [PDF]

2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, 2014
The hamming weight (also known as population count) of a bitstring is the number of 1's in the bitstring. It has applications in scopes like cryptography, chemical informatics and information theory. Typical bitstring lengths range from the processor's word length to several thousands of bits.
Enric Morancho
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Network generalized hamming weight

2009 Workshop on Network Coding, Theory, and Applications, 2009
In this work, we extend the notion of generalized Hamming weight for classical linear block codes to linear network codes by introducing the network generalized Hamming weight (NGHW) for a given network with respect to a fixed linear network code. The basic properties of NGHW are studied.
Chi Kin Ngai, Raymond W. Yeung, Zhixue Zhang   +2 more
openaire   +1 more source