Results 301 to 310 of about 3,086,260 (319)
Some of the next articles are maybe not open access.
Acta Numerica, 2006
In this survey we discuss properties of specific methods of approximation that belong to a family of greedy approximation methods (greedy algorithms). It is now well understood that we need to study nonlinear sparse representations in order to significantly increase our ability to process (compress, denoise,etc.) large data sets. Sparse representations
openaire +1 more source
In this survey we discuss properties of specific methods of approximation that belong to a family of greedy approximation methods (greedy algorithms). It is now well understood that we need to study nonlinear sparse representations in order to significantly increase our ability to process (compress, denoise,etc.) large data sets. Sparse representations
openaire +1 more source
Approximated approximations for SAO
Structural and Multidisciplinary Optimization, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Groenwold, A.A. +2 more
openaire +3 more sources
Mathematica Applicanda, 1981
Let A be a nonexpansive mapping acting in the normed space E and let \(M\subset E\) be an invariant set for A. Assume \(a\in E\) is a fixed point for A. If the restriction of A to M is compact then the set of elements of best approximation of a in M is nonempty.
openaire +2 more sources
Let A be a nonexpansive mapping acting in the normed space E and let \(M\subset E\) be an invariant set for A. Assume \(a\in E\) is a fixed point for A. If the restriction of A to M is compact then the set of elements of best approximation of a in M is nonempty.
openaire +2 more sources
COMBINATORICA, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Canadian Journal of Mathematics, 1984
Let R be an associative ring with 1 ≠ 0. Throughout we will be considering unitary left R-modules. Given a chain complex C over R, a free approximation of C is defined to be a free chain complex F over R together with an epimorphism τ:F → C of chain complexes with the property that H(τ):H(F) ≃ H(C).
openaire +1 more source
Let R be an associative ring with 1 ≠ 0. Throughout we will be considering unitary left R-modules. Given a chain complex C over R, a free approximation of C is defined to be a free chain complex F over R together with an epimorphism τ:F → C of chain complexes with the property that H(τ):H(F) ≃ H(C).
openaire +1 more source
Boussinesq-Approximation (Boussinesq approximation)
2000Es handelt sich um eine mathematische Naherung bei der Beschreibung von Stromungen, die durch Auftriebseffekte hervorgerufen oder beeinflust werden (naturliche bzw. gemischte Konvektion). Dabei wird unterstellt, das die Temperaturabhangigkeit der beteiligten Stoffwerte und hier insbesondere die der Dichte ϱ* bis auf eine einzige Ausnahme vernachlassigt
openaire +1 more source
Canadian Mathematical Bulletin, 1986
AbstractLet C be a cochain complex satisfying the condition that inj.dim. Hq(C) < ∞. Then we prove that C admits an injective approximation.
openaire +1 more source
AbstractLet C be a cochain complex satisfying the condition that inj.dim. Hq(C) < ∞. Then we prove that C admits an injective approximation.
openaire +1 more source
1995
Abstract Although introduced more than 60 years ago it is only during the last 15 years that there has been a systematic development of saddlepoint approximations. These approximations give a highly accurate expression for the tail of a distribution, not only in the centre of the distribution but also for very small tail probabilities ...
openaire +2 more sources
Abstract Although introduced more than 60 years ago it is only during the last 15 years that there has been a systematic development of saddlepoint approximations. These approximations give a highly accurate expression for the tail of a distribution, not only in the centre of the distribution but also for very small tail probabilities ...
openaire +2 more sources
Complex Analysis and Operator Theory, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2013
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source