Results 271 to 280 of about 380,543 (330)

Empirical Bayes Covariance Decomposition, and a Solution to the Multiple Tuning Problem in Sparse PCA. [PDF]

J Comput Graph Stat
Kang J, Stephens M.
europepmc   +1 more source

Resource Allocation and Trajectory Planning in Integrated Sensing and Communication Enabled UAV-Assisted Vehicular Network. [PDF]

Sensors (Basel)
Song M, Song M, Zhang W, Bai J.
europepmc   +1 more source

Graph-Enhanced Expectation Maximization for Emission Tomography. [PDF]

J Imaging
Kasai R, Otsuka H.
europepmc   +1 more source

A well-defined local continuum damage model with softening via convexification and entropic regularization

Lauff C, Schlichting A, Böhlke T, Schneider M.   +3 more
europepmc   +1 more source

A Fixed Point Theorem for Mappings with an Iterate at a Point

A Fixed Point Theorem for Mappings with an Iterate at a Point
openaire  

Some of the next articles are maybe not open access.

Related searches:

Convergence of the fixed‐point iteration for multilinear PageRank

Numerical Linear Algebra With Applications, 2021
AbstractFixed‐point iteration is a popular method for the multilinear PageRank problem. In [B. Meini, F. Poloni, Perron‐based algorithms for the multilinear PageRank, Numer. Linear Algebra Appl., 25: e2177, 2018], a theorem was proved to determine the behavior of the fixed‐point iteration as the parameter .
Gang Wu
exaly   +4 more sources

Sequential iteration of the Erlang fixed-point equations

Information Processing Letters, 2002
The link or route blocking probabilities of a loss network are typically used to assess its performance. Unfortunately, closed form expressions for these, whilst being easy to write down, are quite intractable to evaluate computationally. Consequently, a number of approximations to the blocking probabilities have been proposed.
Andrew G. Hart, Servet Martínez 0001
openaire   +2 more sources

Fixed Point Iteration

, 1992
Iteration seems to play a fundamental role in learning theory - as everywhere else. Since neurons need a rather long time to reach a stable state, Caianiello's Paradox suggests that special actions cause the iteration of state transitions until a stable neural state is reached. Now, a stable state is a fixed point for any transition function; so we may
G. Germano, MAZZANTI, STEFANO
openaire   +2 more sources

Anderson accelerated fixed‐point iteration for multilinear PageRank

Numerical Linear Algebra With Applications, 2023
In this paper, we apply the Anderson acceleration technique to the existing relaxation fixed‐point iteration for solving the multilinear PageRank.
Yannan Chen
exaly   +2 more sources