Results 261 to 270 of about 592,027 (318)

Characterising the failure mechanisms of error-corrected quantum logic gates. [PDF]

Nat Commun
Harper R, Lainé C, Hockings ET, McLauchlan C, Nixon GM, Brown BJ, Bartlett SD.   +6 more
europepmc   +1 more source

RATEX: A Scalable RNA-Based Platform for Logical and Multi-Layered Cellular Programming. [PDF]

Angew Chem Int Ed Engl
Goh H, Kang H, Kim C, Kim J.
europepmc   +1 more source

Early Neuroimmune Modulation in Hereditary Cerebellar Ataxias: Experimental Opportunities in Zebrafish Models. [PDF]

Cells
Naef V, Giacich M, Damiani D, Santorelli FM.   +3 more
europepmc   +1 more source

"In-Series" Continuous Renal Replacement Therapy and Therapeutic Plasma Exchange: Single-Center Retrospective Cohort, 2018-2022. [PDF]

Pediatr Crit Care Med
Williams RH, Carter BG, Escudie M, Harcourt E, Zampetti M, Low H, Khumalo P, Chan C, Duke T, Chiletti R, Butt W.   +10 more
europepmc   +1 more source

Frogs Uncouple Neural Activity From Oxygen Consumption After Hibernation. [PDF]

Acta Physiol (Oxf)
Yaseen H, Santin JM.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Circuits resilient to short-circuit errors

Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022
Given a Boolean circuit C, we wish to convert it to a circuit C′ that computes the same function as C even if some of its gates suffer from adversarial short circuit errors, i.e., their output is replaced by the value of one of their inputs. Can we design such a resilient circuit C′ whose size is roughly comparable to that of C?
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena   +6 more
openaire   +4 more sources

Simulating threshold circuits by majority circuits

Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93, 1993
Summary: We prove that a single threshold gate with arbitrary weights can be simulated by an explicit polynomial-size, depth-2 majority circuit. In general we show that a polynomial-size, depth-d threshold circuit can be simulated uniformly by a polynomial-size majority circuit of depth \(d+1\). \textit{M. Goldmann, J. Håstad}, and \textit{A. Razborov}
Mikael Goldmann, Marek Karpinski
openaire   +1 more source

Algorithms for Circuits and Circuits for Algorithms

2014 IEEE 29th Conference on Computational Complexity (CCC), 2014
The title of this paper is meant to highlight an emerging duality between two fundamental topics in algorithms and complexity theory. Algorithms for circuits} refers to the design of interesting algorithms which can perform non-trivial circuit analysis of some kind, on either a circuit or a Boolean function given as a truth table.
openaire   +1 more source