Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F09%3A00315078" target="_blank" >RIV/67985807:_____/09:00315078 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions
Original language description
Estimates in terms of smoothness are derived for approximation rates by Gaussian radial-basis networks.
Czech name
Složitost Gaussovských radiálních sítí
Czech description
Odhady vyjádřené pomocí hladkosti jsou odvozeny pro aproximaci Gaussovskými radiálními sítěmi.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F08%2F1744" target="_blank" >GA201/08/1744: Complexity of perceptron and kernel networks</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Complexity
ISSN
0885-064X
e-ISSN
—
Volume of the periodical
25
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
—
UT code for WoS article
000262046900005
EID of the result in the Scopus database
—