Results 271 to 280 of about 423,241 (305)

Joint Clustering and Power Optimization for the SPMA Protocol in UAV Swarm Communication in Frequency-Constrained Scenarios. [PDF]

Sensors (Basel)
Wu Y, Oh C, Nie H, Kim BS.
europepmc   +1 more source

Cooperative Design of Ranging and Communication for In-Band Full-Duplex Inter-Satellite Links. [PDF]

Sensors (Basel)
Feng H, Yang Z, Ma H, Jiao Y, Wu T, Cai Y, Ma H, Shan Z.   +7 more
europepmc   +1 more source

A DR-<i>ℓ</i>₁-PRLS Approach to Adaptive Equalization in Single-Carrier UWA Communication. [PDF]

Sensors (Basel)
Chen XC, Dai GQ, Shi Y, Wu FY.
europepmc   +1 more source

Decoding cellular population dynamics through mechanistic modelling and statistical data analysis. [PDF]

NPJ Syst Biol Appl
Alachkar N, Opoku NKO, Monk NAM, Thurley K.   +3 more
europepmc   +1 more source

The theory of psychic quanta: a quantum model for the unity of individual consciousness. [PDF]

Front Psychol
Tallarico A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the complexity of communication complexity

Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009
We consider the following question: given a two-argument boolean function f, represented as an N x N binary matrix, how hard is it to determine the (deterministic) communication complexity of f?We address two aspects of this question. On the computational side, we prove that, under appropriate cryptographic assumptions (such as the intractability of ...
Eyal Kushilevitz, Enav Weinreb
openaire   +1 more source

Interactional Complexity and Communication

Family Process, 1984
This paper draws attention to an over‐simplification that we believe has been frequently made in the analysis of interpersonal communication. This happens when one uses interpersonal communication models that do not match the interactional complexity of the system under observation.
C, Ricci, M, Selvini-Palazzoli
openaire   +2 more sources

On the Communication Complexity of AND Functions

IEEE Transactions on Information Theory, 2021
Log-rank conjecture is one of challenging problems in communication complexity. It is known to hold for some special function classes such as XOR functions $\text {f}(\text {x}\oplus \text {y})$ when the outer function f is monotone, symmetric, $\mathsf {AC}^{0}$ , low $\mathbb {F}_{2}$ -degree, linear threshold or read-k.
openaire   +1 more source