نتایج جستجو برای: nurtures basis
تعداد نتایج: 382823 فیلتر نتایج به سال:
We show that the universal Gröbner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity binomial edge ideal and prove this conjecture for the case when the underlying graph is the complete graph.
This paper proves the convergence of applying the radial basis functions as a global spatial approximation method for solving the option pricing models. The computational advantage of this method is illustrated by giving numerical examples on solving both the European and American options pricing models whereas the latter is a free boundary value problem.
The restoration of marine habitats is becoming a primary strategy for managing healthy coastal ecosystems, but initiatives often fail due to conflicts with social or industry activities. Confronting the challenge expanding ‘Ocean Decade’, this paper explores ways that researchers could improve way Governments and practitioners engage stakeholders restorations high socio-ecological economic valu...
Mara Popovic's house in Gracanica, although built an urban setting, seems to belong the classic solution of a three-tract bosnian chardaklia. The was city district named Varos on gently sloping terrain with southern exposure. erected (1840) by father-in-law, Popovic, who lived this until her death, after which property changed several owners. Today, is owned Municipality and used well-known ass...
Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal Gröbner bases can be computed.
In this paper we apply normalized radial basis function networks to function learning and in nonparametric classification. A simple parameter learning technique is proposed and convergence and the rates of convergence of the empirically trained networks are studied theoretically and in computer experiments.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید