Results 231 to 240 of about 168,055 (268)
Some of the next articles are maybe not open access.
International Statistical Review / Revue Internationale de Statistique, 1992
Summary: The question of smoothing when using the non-parametric version of the bootstrap for estimation of population functionals is reconsidered. In general, there is no global preference for procedures based on a smoothed version of the empirical distribution rather than the empirical distribution itself.
de Angelis, Daniela, Young, G. Alastair
openaire +2 more sources
Summary: The question of smoothing when using the non-parametric version of the bootstrap for estimation of population functionals is reconsidered. In general, there is no global preference for procedures based on a smoothed version of the empirical distribution rather than the empirical distribution itself.
de Angelis, Daniela, Young, G. Alastair
openaire +2 more sources
Proceedings of the London Mathematical Society, 2016
We give a classical proof of the generalization of the characterization of smoothness to quotients of Polish spaces by Borel equivalence relations. As an application, we describe the extent to which any given Borel equivalence relation on a Polish space is encoded by the corresponding σ-ideal generated by the family of Borel sets on which it is smooth.
Clemens, John +2 more
openaire +3 more sources
We give a classical proof of the generalization of the characterization of smoothness to quotients of Polish spaces by Borel equivalence relations. As an application, we describe the extent to which any given Borel equivalence relation on a Polish space is encoded by the corresponding σ-ideal generated by the family of Borel sets on which it is smooth.
Clemens, John +2 more
openaire +3 more sources
Slow is smooth, smooth is fast
Journal of NeuroInterventional Surgery, 2022Colasurdo M., Gandhi D.
openaire +2 more sources
Journal of Chemometrics, 2005
AbstractIn many applications it is expected from theory that a signal should be non‐negative and unimodal, that is, show only one peak. If the data are noisy, standard smoothing algorithms will not always give the desired result: peaks may be rounded and negative lobes may occur in the tails.
openaire +2 more sources
AbstractIn many applications it is expected from theory that a signal should be non‐negative and unimodal, that is, show only one peak. If the data are noisy, standard smoothing algorithms will not always give the desired result: peaks may be rounded and negative lobes may occur in the tails.
openaire +2 more sources
International Journal of Geographical Information Science, 2013
To smooth noises inherent in uniformly sampled dataset, the smoothness of high accuracy surface modeling HASM was explored, and a smoothing method of HASM HASM-SM was developed based on a penalized least squares method. The optimal smoothing parameter of HASM-SM was automatically obtained by means of the generalized cross-validation GCV method.
Chuanfa Chen +3 more
openaire +2 more sources
To smooth noises inherent in uniformly sampled dataset, the smoothness of high accuracy surface modeling HASM was explored, and a smoothing method of HASM HASM-SM was developed based on a penalized least squares method. The optimal smoothing parameter of HASM-SM was automatically obtained by means of the generalized cross-validation GCV method.
Chuanfa Chen +3 more
openaire +2 more sources
Fuzzy Sets and Systems, 2001
This paper is reviewed together with the following item Zbl 0977.20059.
openaire +2 more sources
This paper is reviewed together with the following item Zbl 0977.20059.
openaire +2 more sources
Journal of Microscopy, 2002
SummaryA modification of the general fractionator sampling technique called the smooth fractionator is presented. It may be used in almost every situation in which sampling is performed from distinct items that are uniquely defined, often they are physically separated items or clusters like pieces, blocks, slabs, sections, etc.
openaire +2 more sources
SummaryA modification of the general fractionator sampling technique called the smooth fractionator is presented. It may be used in almost every situation in which sampling is performed from distinct items that are uniquely defined, often they are physically separated items or clusters like pieces, blocks, slabs, sections, etc.
openaire +2 more sources
Patterns, Smoothness and Rational Smoothness
2000In this chapter we describe several combinatorial tests for smoothness and rational smoothness in terms of avoiding certain patterns in permutations. These algorithms run in polynomial time in the size of the permutations, and are therefore the most efficient tests known at this time.
Sara Billey, V. Lakshmibai
openaire +1 more source
Ultra smooth continua are smooth
Rendiconti del Circolo Matematico di Palermo, 1999A continuum \(X\) is said to be smooth at a point \(p \in X\) if it is hereditarily unicoherent at \(p\) and for each \(x \in X\) and each sequence \(\{x_n\}\) converging to \(x\) the sequence of irreducible continua \(\{I(p,x_n)\}\) converges to the irreducible continuum \(I(p,x).\) \(X\) is said to be smooth if it is smooth at some point. A continuum
openaire +2 more sources
A Generalized Framework for Edge-Preserving and Structure-Preserving Image Smoothing
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2022Wei Liu, Michael Ng, Yinjie Lei
exaly