Results 271 to 280 of about 5,976,148 (331)

Clinical Validation of Artificial Intelligence (AI)‐based Cartilage Segmentation Predicting Knee Replacement

Arthritis Care &Research, Accepted Article.
Objective For cartilage morphology to serve as a scalable endpoint in clinical trials, analyses should be performed automatically without human interaction. To clinically validate artificial intelligence (AI)‐based analysis, we studied cartilage loss from MRI prior to knee replacement.
Felix Eckstein, David J. Hunter, C. Kent Kwoh, Wolfgang Wirth   +3 more
wiley   +1 more source

A Tutorial Review of Bayesian Optimization with Gaussian Processes to Accelerate Stationary Point Searches. [PDF]

ACS Phys Chem Au
Goswami R.
europepmc   +1 more source

Explicitly Incorporating Prior Knowledge into Bayesian Optimization for Materials Design. [PDF]

ACS Omega
Aoki H, Miyao T.
europepmc   +1 more source

Ray Marching Aspheric Surfaces: Robust Ray Intersection Calculation for Design of Optical Sensors. [PDF]

Sensors (Basel)
Sanzharov V, Ershov S, Frolov V, Galaktionov V, Voloboy A.   +4 more
europepmc   +1 more source

Qualitative analysis and numerical simulation of ABC fractional impulsive differential systems with implicit nonlinear terms and integral boundary conditions. [PDF]

PLoS One
Sharif AA, Hamood M, Ghadle KP.
europepmc   +1 more source

Convergence analysis of Suzuki's generalized nonexpansive mappings using the Picard-Abbas iteration process. [PDF]

PLoS One
Nawaz B, Gdawiec K, Ullah K, Noorwali M, Aphane M.   +4 more
europepmc   +1 more source

Constant-time hardware implementation of Modular Inversion with Kaliski's Algorithm for ECC. [PDF]

PLoS One
Nguyen K, Nguyen T, Nguyen H, Tran L.
europepmc   +1 more source

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, 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
exaly   +3 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.
Fuqi Lai, Wen Li, Xiaofei Peng, Yannan Chen   +3 more
exaly   +2 more sources