Results 281 to 290 of about 3,476,975 (297)
Some of the next articles are maybe not open access.
Advances in Computational Mathematics, 1999
Given \(n+1\) disjoint bounded intervals \(I_0, \ldots ,I_n\) and \(n+1\) real numbers \(\alpha_0,\ldots ,\alpha_n\), a polynomial is to be determined such that its median in the interval \(I_j\) equals \(\alpha_j\) \((j=0,\ldots ,n)\). Although there is a connection with \(L_1\)-approximation, this is a nonlinear ``interpolation problem''. Topological
Tim N. T. Goodman, Thomas P. Y. Yu
openaire +1 more source
Given \(n+1\) disjoint bounded intervals \(I_0, \ldots ,I_n\) and \(n+1\) real numbers \(\alpha_0,\ldots ,\alpha_n\), a polynomial is to be determined such that its median in the interval \(I_j\) equals \(\alpha_j\) \((j=0,\ldots ,n)\). Although there is a connection with \(L_1\)-approximation, this is a nonlinear ``interpolation problem''. Topological
Tim N. T. Goodman, Thomas P. Y. Yu
openaire +1 more source
Multimedia Manual of Cardio-Thoracic Surgery, 2015
Sternotomy is considered to be the gold standard incision in cardiac surgery, resulting in low failure rates and excellent proven long-term outcomes. It can also be used in thoracic surgery for mediastinal, bilateral pulmonary or lower trachea and main stem bronchus surgery.
Reser D +4 more
openaire +5 more sources
Sternotomy is considered to be the gold standard incision in cardiac surgery, resulting in low failure rates and excellent proven long-term outcomes. It can also be used in thoracic surgery for mediastinal, bilateral pulmonary or lower trachea and main stem bronchus surgery.
Reser D +4 more
openaire +5 more sources
Pattern Recognition Letters, 1985
The concept of 'median string' over a set of strings is introduced in this paper. The set median is defined to be that element in the set of strings which has the smallest sum of distances (with respect to an arbitrary measure) from the other elements, and the (generalized) median is a hypothetical, artificially constructed element which has the ...
openaire +1 more source
The concept of 'median string' over a set of strings is introduced in this paper. The set median is defined to be that element in the set of strings which has the smallest sum of distances (with respect to an arbitrary measure) from the other elements, and the (generalized) median is a hypothetical, artificially constructed element which has the ...
openaire +1 more source
Fuzzy Sets and Systems, 2001
Distance aggregation operators are introduced. In the case of singleton-based distance, a well-known class of \(K\)-medians is recovered. For interval-based distance, a characterization of \((p,r)\)-distance aggregation operators is given, in the general case as well as for idempotent operators.
Tomasa Calvo, Radko Mesiar
openaire +2 more sources
Distance aggregation operators are introduced. In the case of singleton-based distance, a well-known class of \(K\)-medians is recovered. For interval-based distance, a characterization of \((p,r)\)-distance aggregation operators is given, in the general case as well as for idempotent operators.
Tomasa Calvo, Radko Mesiar
openaire +2 more sources
2013
The classification task uses observations and prior knowledge to select a hypothesis that will predict class assignments well. In this work we ask the question: what is the best hypothesis to select from a given hypothesis class? To address this question we adopt a PAC-Bayesian approach. According to this viewpoint, the observations and prior knowledge
Ran Gilad-Bachrach +1 more
openaire +1 more source
The classification task uses observations and prior knowledge to select a hypothesis that will predict class assignments well. In this work we ask the question: what is the best hypothesis to select from a given hypothesis class? To address this question we adopt a PAC-Bayesian approach. According to this viewpoint, the observations and prior knowledge
Ran Gilad-Bachrach +1 more
openaire +1 more source
On root structures of median and median-type filters
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1987In this correspondence, we analyze the root structures of the standard median (SM) filters, the recursive median (RM) filters, and the FIR median hybrid (FMH) filters. It is shown that these filters have many oscillatory infinitely long root signals.
Jaakko Astola +2 more
openaire +1 more source
Mathematical Programming, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AVELLA P., SASSANO, Antonio
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AVELLA P., SASSANO, Antonio
openaire +3 more sources
Computational Statistics & Data Analysis, 2006
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
Median value and median interval of a fuzzy number
Information Sciences, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Convergence properties of median and weighted median filters
IEEE Transactions on Signal Processing, 1994It has been shown that assuming the first and last value carry-on appending strategy, a finite number of passes of the same median filter to an arbitrary signal of finite length results in a root signal that will be invariant to additional filtering passes. This so-called convergence property is reproven using an extremely simple approach. In addition,
openaire +2 more sources