Results 131 to 140 of about 85,893 (168)

DeepFixel: Crossing white matter fiber identification through spherical convolutional neural networks. [PDF]

Proc SPIE Int Soc Opt Eng
Saunders AM, Remedios LW, McMaster EM, Yoon J, Rudravaram G, Sadriddinov A, Kanakaraj P, Landman BA, Anderson AW.   +8 more
europepmc   +1 more source

Real-World Emulation of Landmark Lung Cancer Trials: A Registry-Based Reconstruction of KN189, KN407, IMpower133, and PACIFIC. [PDF]

Cancers (Basel)
Surovtsova I, Eberhardt WEE, Meschke DE, Morakis P.   +3 more
europepmc   +1 more source

Weighted approximation on the real axis

openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Approximate Degree, Weight, and Indistinguishability

ACM Transactions on Computation Theory, 2022
We prove that the OR function on {-1,1\} n can be pointwise approximated with error ε by a polynomial of degree O ( k ) and weight 2 O ( n log (1/ε)/k)
Xuangui Huang, Emanuele Viola
openaire   +2 more sources

Approximating weighted induced matchings

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Chih Lin, Julián Mestre, Saveliy Vasiliev   +2 more
openaire   +3 more sources

Weighted Polynomial Approximations

2001
In this chapter, we establish the existence of weighted polynomial approximations that are a prerequisite to the estimates and asymptotics in subsequent chapters. We search for polynomials P n of degree n such that P n W approximates 1 in some sense on [a −n, a n ].
Eli Levin, Doron S. Lubinsky
openaire   +1 more source

Nonlinear Approximation and Muckenhoupt Weights

Constructive Approximation, 2006
In the general atomic setting of an unconditional basis in a (quasi-) Banach space, we show that representing the spaces of m-terms approximation as Lorentz spaces is equivalent to the verification of two inequalities (Jackson and Bernstein), and that the validity of these two properties is equivalent to the Temlyakov property. The proof is very direct
Kerkyacharian, G., Picard, D.
openaire   +2 more sources

Approximate Matching in Weighted Sequences

2006
Weighted sequences have been recently introduced as a tool to handle a set of sequences that are not identical but have many local similarities. The weighted sequence is a “statistical image” of this set, where the probability of every symbol's occurrence at every text location is given.
Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat   +3 more
openaire   +1 more source

Approximating weighted matchings in parallel

Information Processing Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Hougardy, Doratha E. Drake Vinkemeier   +1 more
openaire   +2 more sources