Results 251 to 260 of about 456,084 (310)

Sexual prejudice declined across generational cohorts and genders: A cohort sequential latent growth curve model from 2014 to 2024. [PDF]

Br J Soc Psychol
Clarke EV, Sibley CG, Osborne D.
europepmc   +1 more source

Exploring Secondary Structure Predictions for RNA-Targeted Drug Discovery: Power and Challenges. [PDF]

J Chem Inf Model
Zhang Z, Dolcetti G, Tyrchan C, De Maria L, Bussi G, Czechtizky W.   +5 more
europepmc   +1 more source

Generalization bounds for a generator-regularized InfoGAN-inspired adversarial objective. [PDF]

Front Artif Intell
Hasan M, Muia MN, Islam MM.
europepmc   +1 more source

Negligence, malpractice and recklessness committed by otorhinolaryngologists in the state of São Paulo-Brazil. [PDF]

Braz J Otorhinolaryngol
Marquezini Chammes RM, Fujita RR.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Bounding the Error Function

Computing in Science & Engineering, 2021
Prompted by previous work published in this magazine, in this article we focus on the derivation of global analytical bounds for the error function of a real argument. Using an integral representation of this function, we obtain two simple and accurate lower bounds, which complement a well-known upper bound given long ago by Polya.
openaire   +1 more source

On Error Bounds for Quasinormal Programs

Journal of Optimization Theory and Applications, 2010
Let \(I\) and \(I_{0}\) be finite index sets, \(h_{i}:\mathbb{R}^{m}\rightarrow \mathbb{R}\) \((i\in I\cup I_{0})\) be continuously differentiable functions, and \(C:=\{y\in \mathbb{R}^{m}:h_{i}(y)\leq 0\) \((i\in I),\) \(h_{i}(y)=0\) \((i\in I_{0})\}\). The main result states that, assuming that the gradients \(\nabla h_{i}(y)\) \((i\in I\cup I_{0})\)
Leonid Minchenko, Alexander Tarakanov
openaire   +1 more source

Error-bounded compatible remeshing

ACM Transactions on Graphics, 2020
We present a novel method to construct compatible surface meshes with bounded approximation errors. Given two oriented and topologically equivalent surfaces and a sparse set of corresponding landmarks, our method contains two steps: (1) generate compatible meshes with bounded approximation errors and (2) reduce mesh complexity while ensuring that ...
Yang Yang 0065, Wen-Xiang Zhang, Yuan Liu 0025, Ligang Liu 0001, Xiao-Ming Fu 0001   +4 more
openaire   +1 more source

Sufficient Conditions for Error Bounds

SIAM Journal on Optimization, 2002
Summary: For a lower semicontinuous (l.s.c.) inequality system on a Banach space, it is shown that error bounds hold, provided every element in an abstract subdifferential of the constraint function at each point outside the solution set is norm bounded away from zero. A sufficient condition for a global error bound to exist is also given for an l.s.c.
Zili Wu, Jane J. Ye
openaire   +2 more sources

On the Complexity of Computing Error Bounds

Foundations of Computational Mathematics, 2001
The authors study the cost of estimating the norm of an inverse matrix. They conjecture that finding even a coarse error bound is as costly as that of matrix inversion itself. Conversely, any fast condition estimate must sometimes mis-estimate by a sizable amount, specified quantitatively in the paper.
James Demmel, Benjamin Diament, Gregorio Malajovich   +2 more
openaire   +2 more sources