نتایج جستجو برای: best approximation2000 mathematics subject classication 46a30

تعداد نتایج: 762910  

2003

—This paper refers only to universities (including technical universities), and none of our proposals apply to other types of institutions. —The aim of a «common framework for mathematics degrees in Europe» is to facilitate an automatic recognition of degrees in order to help mobility. —The idea of a common framework must be combined with an accreditation system. —The two components of a common...

Journal: :Indonesian Journal of Electrical Engineering and Computer Science 2018

2002
Antonella De Robbio Dario Maguolo Alberto Marini

This talk aims to give a feeling of the roles that discipline-oriented subject classifications play in scientific communication, in the perspective of the Open Archives movement for the free dissemination of information in research activities. Mathematics, and Mathematics Subject Classification, will be the focuses around which we will move to discover a variety of presentation modes, protocols...

1997
Vinod Chandran Stefan Slomka Megan Gollogly Steve Elgar

Features derived from the trispectra of DFT magnitude slices are used for multi-font digit recognition. These features are insensitive to translation, rotation, or scaling of the input. They are also robust to noise. Classication accuracy tests were conducted on a common data base of 256256 pixel bilevel images of digits in 9 fonts. Randomly rotated and translated noisy versions were used for t...

Journal: :IEICE Transactions 1995
Akio Nishikawa Kenji Satou Emiko Furuichi Satoru Kuhara Kazuo Ushijima

We also thank the anonymous referees for their valuable comments. 1 Summary Scientic database systems for the analysis of genes and proteins are becoming very important these days. We have developed a deductive database system PACADE for analyzing the three dimensional and secondary structures of proteins. In this paper, we describe the statistical data classication component of PACADE. We impl...

Journal: :J. Applied Probability 2014
Ruodu Wang

Suppose X1, · · · , Xn are random variables with the same known marginal distribution F but unknown dependence structure. In this paper, we study the smallest possible value of P(X1 + · · ·+ Xn < s) over all possible dependence structures, denoted by mn,F(s). We show that mn,F(ns) → 0 for s no more than the mean of F under weak assumptions. We also derive a limit of mn,F(ns) for any s ∈ R with ...

Journal: :Adv. Comput. Math. 1995
Gerlind Plonka-Hoch Hagen Schumacher Manfred Tasche

Biorthogonal wavelets are essential tools for numerous practical applications. It is very important that wavelet transforms work numerically stable in floating point arithmetic. This paper presents new results on the worst-case analysis of roundoff errors occurring in floating point computation of periodic biorthogonal wavelet transforms, i.e. multilevel wavelet decompositions and reconstructio...

Journal: :ITA 2001
Rudolf Grübel Anke Reimers

We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm a...

2003
HENRYK WOŹNIAKOWSKI N. Vakhania Nicholas N. Vakhania N. N. Vakhania

We study tractability in the worst case setting of tensor product linear operators defined over weighted tensor product Hilbert spaces. Tractability means that the minimal number of evaluations needed to reduce the initial error by a factor of ε in the d-dimensional case has a polynomial bound in both ε−1 and d. By one evaluation we mean the computation of an arbitrary continuous linear functio...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید