Results 31 to 40 of about 2,172,385 (299)
Algorithms and error bounds for multivariate piecewise constant approximation [PDF]
We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Davydov, Oleg
core +3 more sources
Topological structures of fuzzy neutrosophic rough sets [PDF]
In this paper, we examine the fuzzy neutrosophic relation having a special property that can be equivalently characterised by the essential properties of the lower and upper fuzzy neutrosophic rough approximation operators. Further, we prove that the set
C. Antony Crispin Sweety, I. Arockiarani
doaj
Approximation numbers of an infinite matrix on HpB spaces [PDF]
In this paper, we study conditions that an infinite matrix has to satisfy in order to define a linear bounded operator from any weighted HpB space[1] with a weighted sequence of positive numbers into itself, and give upper and lower estimations of the ...
Nashat Faried, Hany El Deeb
doaj +1 more source
T-upper approximation spaces [PDF]
We define extensional spaces. Moreover, we investigate the relations among T-upper-approximation spaces, T-quasi -equivalence relations and extensional spaces.
Yong-Chan Kim, Jung-Mi Ko
openaire +1 more source
Collegian UIU student newspaper 2013-2022
Collegian published through Tumblr website.Copied from Tumblr and combined into single document.[Title], Upper Iowa University Digital Archives, [Reference URL].
Upper Iowa University
core +1 more source
Soft Covering Based Rough Sets and Their Application
Soft rough sets which are a hybrid model combining rough sets with soft sets are defined by using soft rough approximation operators. Soft rough sets can be seen as a generalized rough set model based on soft sets.
Şaziye Yüksel +2 more
doaj +1 more source
Variational Inference via Rényi Bound Optimization and Multiple-Source Adaptation
Variational inference provides a way to approximate probability densities through optimization. It does so by optimizing an upper or a lower bound of the likelihood of the observed data (the evidence).
Dana Zalman (Oshri), Shai Fine
doaj +1 more source
Streaming Algorithms with Large Approximation Factors [PDF]
We initiate a broad study of classical problems in the streaming model with insertions and deletions in the setting where we allow the approximation factor α to be much larger than 1.
Zhang, Yuheng +3 more
core +1 more source
Approximability of the upper chromatic number of hypergraphs
A C-coloring of a hypergraph ${\cal H}=(X,{\cal E})$ is a vertex coloring $φ: X\to {\mathbb{N}}$ such that each edge $E\in{\cal E}$ has at least two vertices with a common color. The related parameter $\overlineχ({\cal H})$, called the upper chromatic number of ${\cal H}$, is the maximum number of colors can be used in a C-coloring of ${\cal H}$.
Csilla Bujtás, Zsolt Tuza
openaire +5 more sources
ABSTRACT Background Survivors of pediatric brain tumors (PBTs) can experience long‐term social difficulties, impacting quality of life. Beyond medical and environmental factors, family psychosocial risk may play a role in social outcomes by shaping the caregiving environment and may provide intervention options.
Renske H. Houben +4 more
wiley +1 more source

