Results 31 to 40 of about 1,437,192 (281)

Subspace Least Squares Multidimensional Scaling

open access: yes, 2017
Multidimensional Scaling (MDS) is one of the most popular methods for dimensionality reduction and visualization of high dimensional data. Apart from these tasks, it also found applications in the field of geometry processing for the analysis and ...
Boyarski, Amit   +2 more
core   +1 more source

Efficient least-squares basket-weaving

open access: yes, 2012
We report on a novel method to solve the basket-weaving problem. Basket-weaving is a technique that is used to remove scan-line patterns from single-dish radio maps. The new approach applies linear least-squares and works on gridded maps from arbitrarily
Flöer, L., Kraus, A., Winkel, B.
core   +1 more source

Geodesic least squares regression on information manifolds [PDF]

open access: yes, 2014
We present a novel regression method targeted at situations with significant uncertainty on both the dependent and independent variables or with non-Gaussian distribution models.
Verdoolaege, Geert
core   +2 more sources

Deformation analysis with Total Least Squares [PDF]

open access: yesNatural Hazards and Earth System Sciences, 2006
Deformation analysis is one of the main research fields in geodesy. Deformation analysis process comprises measurement and analysis phases. Measurements can be collected using several techniques. The output of the evaluation of the measurements is mainly
M. Acar   +4 more
doaj  

Least squares approximations of power series

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2006
The classical least squares solutions in C[−1,1] in terms of linear combinations of ultraspherical polynomials are extended in order to estimate power series on (−1,1). Approximate rates of uniform and pointwise convergence are obtained, which correspond
James Guyker
doaj   +1 more source

Survival Outcomes and Complications Among Canadian Children With Retinoblastoma: A Population‐Based Report From CYP‐C

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Purpose Retinoblastoma (RB) is the most common pediatric ocular cancer, yet population‐based data on survival and risk factors remain limited. This study aimed to describe survival in a large national RB cohort and identify predictors of death and complications.
Samuel Sassine   +14 more
wiley   +1 more source

Least Squares Generative Adversarial Networks-Based Anomaly Detection

open access: yesIEEE Access, 2022
Multivariate statistical process control (MSPC) is a technique for detecting anomalies by monitoring several quality characteristics simultaneously. For the MSPC problem, the Hotelling’s $T^{2}$ control chart has been widely used as a typical ...
Chang-Ki Lee   +2 more
doaj   +1 more source

Financial Burden Associated With Hospitalisation Among Families of Childhood Brain Tumours in Australia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Families of children with cancer experience significant financial strain, even with universal healthcare. Indirect costs, such as productivity losses and non‐medical expenses, are rarely included in economic evaluations, and little is known about how effectively financial aid programmes alleviate this burden. Childhood brain tumours
Megumi Lim   +8 more
wiley   +1 more source

The Fate (Outcome) of Clinically Apparent Single Lesion and Oligofocal Nephroblastomatosis Treated According to SIOP/GPOH Protocols for Wilms Tumor

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background The management of clinically apparent single lesions or oligofocal nephroblastomatosis, a facultative precursor of nephroblastoma, remains debated. Methods We retrospectively analyzed 37 patients with clinically apparent single or oligofocal nephroblastomatosis (two to three lesions per kidney) among 2347 patients registered between
Nils Welter   +17 more
wiley   +1 more source

On weighted structured total least squares

open access: yes, 2006
In this contribution we extend the result of (Markovsky et. al, SIAM J. of Matrix Anal. and Appl., 2005) to the case of weighted cost function. It is shown that the computational complexity of the proposed algorithm is preserved linear in the sample size
G. Golub   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy