Results 141 to 150 of about 2,610,566 (306)
Randomized algorithms for distributed computation of principal component analysis and singular value decomposition. [PDF]
Li H, Kluger Y, Tygert M.
europepmc +1 more source
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 +3 more
wiley +1 more source
Stability of randomized learning algorithms
We extend existing theory on stability, namely how much changes in the training data influence the estimated models, and generalization performance of deterministic learning algorithms to the case of randomized algorithms.
Pack Kaelbling +3 more
core
Randomized Algorithms for Geometric Optimization Problems
This chapter reviews randomization algorithms developed in the last few years to solve a wide range of geometric optimization problems. We review a number of general techniques, including randomized binary search, randomized linear-programming algorithms,
Sandeep Sen, Pankaj K. Agarwal
core +1 more source
Interstitial lung disease (ILD) is a significant cause of morbidity and mortality in patients with inflammatory rheumatic disorders (IRDs). High‐resolution computed tomography (HRCT) is widely considered the gold standard for the noninvasive assessment of ILD; however, its interpretation is constrained by substantial interobserver variability and the ...
Alexander Pfeil +7 more
wiley +1 more source
Introduction Systemic sclerosis (SSc) is characterized by cardiovascular risk excess not fully explained by traditional factors. Whether the severity of microvascular damage correlates with structural subclinical atherosclerosis remains unclear. We investigated the relationship between nailfold videocapillaroscopy (NVC) abnormalities and carotid ...
Eugenio Capparelli +13 more
wiley +1 more source
Halving the cost of quantum algorithms with randomization
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized compiling, a technique
John M. Martyn, Patrick Rall
doaj +1 more source
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source

