Results 261 to 270 of about 17,450 (322)

High-Accuracy Prediction of Chunmee Tea Grade via DeepSpectra Model and Near-Infrared Spectroscopy. [PDF]

Foods
Zhang Y, Ren M, Wu X, Wu B.
europepmc   +1 more source

Eccentric sombor index of graphs and its role in the structure-property relationship analysis of polycyclic aromatic compounds. [PDF]

Sci Rep
Khaji B, Hanif S, Arathi Bhat K.
europepmc   +1 more source

Certificateless data integrity auditing with sparse Merkle trees for the cloud-edge environment. [PDF]

Sci Rep
Du R, Wang Z, Shen J.
europepmc   +1 more source

GeneSNAKE: a Python package for simulation of gene regulatory networks and perturbation-induced expression data. [PDF]

Bioinform Adv
Hillerton T, Björk A, Lundqvist N, Zhivkoplias EK, Garbulowski M, Sonnhammer ELL.   +5 more
europepmc   +1 more source

Movement Artifact Direction Estimation Based on Signal Processing Analysis of Single-Frame Images. [PDF]

Sensors (Basel)
Nonsakhoo W, Saiyod S.
europepmc   +1 more source

Multiplicative Complexity of XOR Based Regular Functions

IEEE Transactions on Computers, 2022
XOR-AND Graphs (XAGs) are an enrichment of the classical AND-Inverter Graphs (AIGs) with XOR nodes. In particular, XAGs are networks composed by ANDs, XORs, and inverters.
Anna Bernasconi, Stelvio Cimato, Valentina Ciriani   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Lower bounds for the multiplicative complexity of matrix multiplication

Computational Complexity, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Bläser
exaly   +4 more sources

Tight bounds for the multiplicative complexity of symmetric functions

Theoretical Computer Science, 2008
The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f, when only exclusive-or, conjunction and negation gates may be used.
Joan Boyar, René Peralta
exaly   +3 more sources