Results 151 to 160 of about 6,152,737 (292)
Local Smoothing by Polynomials in n Dimensions [PDF]
The Computer Journal, 1969 A. J. Cole, Antony J. T. Davie
openaire +2 more sources
Extrinsic and Intrinsic Charge Transfer at Interfaces of Membrane‐Based Oxide Heterostructures
Advanced Electronic Materials, EarlyView.Freestanding oxides have emerged as a new opportunity to tailor oxides outside of the typical epitaxial constraints. We present the fabrication of TiO2‐terminated SrTiO3 membranes via direct growth control. We demonstrate competing ionic and electronic charge transfer in LaAlO3/SrTiO3 bilayers using near ambient pressure XPS.
Kapil Nayak +8 more
wiley +1 more source
Local behaviour of the polynomial calculus of operators.
Journal für die reine und angewandte Mathematik (Crelles Journal), 1992 Let \(T\) be a bounded operator on a Hilbert space \(X\). Then there exists a dense subset of points \(x\in X\) with the property that \(\| p(T)x\|\) is big enough for every polynomial \(p\), i.e. \(\| p(T)x\|\sim n^{- (2+\varepsilon)}r_ e(p(T))\), where \(n=\deg p\) and \(r_ e\) denotes the essential spectral radius; in the case of a Hilbert space \(\|
openaire +1 more source
Nonparametric Estimation and Symmetry Tests for Conditional Density Functions. [PDF]
We suggest two new methods for conditional density estimation. The first is based on locally fitting a log-linear model, and is in the spirit of recent work on locally parametric techniques in density estimation.
Hyndman, R.J., Yao, Q.
core
Advanced Electronic Materials, EarlyView.Passive resistive memory arrays promise efficient in‐memory computing but suffer from sneak paths and programming variability. Here, highly uniform 32 × 32 passive RRAM crossbars are programmed with multilevel precision below 3% error and 99.5% yield.
S. Ricci +6 more
wiley +1 more source
Polynomial Time Local Decision Revisited
We consider three classification systems for distributed decision tasks: With unbounded computation and certificates, defined by Balliu, D'Angelo, Fraigniaud, and Olivetti [JCSS'18], and with (two flavors of) polynomially bounded local computation and certificates, defined in recent works by Aldema Tshuva and Oshman [OPODIS'23], and by Reiter [PODC'24].
Laurent Feuilloley +2 more
openaire +2 more sources
, 2015 This thesis examines local polynomial regression. Local polynomial regression is one of non-parametric approach of data fitting. This particular method is based on repetition of fitting data using weighted least squares estimate of the parameters of the ...
Cigán, Martin
core
A Dual‐Branch Flux‐Based Extended Memristor Model With Machine‐Learning‐Assisted Calibration
Advanced Electronic Materials, EarlyView.Multilayer oxide memristors integrated in crossbar arrays are described through a dual‐branch, flux‐controlled compact model. A three‐stage calibration workflow combining Latin hypercube sampling, Bayesian optimization, and gradient‐based refinement extracts device parameters from experimental data.
Davide Rossetti +6 more
wiley +1 more source
A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits
Physical Review XWe provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational ...
Thomas Schuster +3 more
doaj +1 more source
Smart Exploration of Perovskite Photovoltaics: From AI Driven Discovery to Autonomous Laboratories
Advanced Energy Materials, EarlyView.In this review, we summarize the fundamentals of AI in automated materials science, and review AI applications in perovskite solar cells. Then, we sum up recent progress in AI‐guided manufacturing optimization, and highlight AI‐driven high‐throughput and autonomous laboratories.
Wenning Chen +4 more
wiley +1 more source