Number of the records: 1  

Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions

  1. SYS0315078
    LBL
      
    01725^^^^^2200277^^^450
    005
      
    20240103190708.8
    014
      
    $a 000262046900005 $2 WOS
    014
      
    $a 56949103612 $2 SCOPUS
    017
      
    $a 10.1016/j.jco.2008.08.001 $2 DOI
    100
      
    $a 20081121d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a US
    200
    1-
    $a Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions
    215
      
    $a 12 s.
    463
    -1
    $1 001 cav_un_epca*0253670 $1 011 $a 0885-064X $e 1090-2708 $1 200 1 $a Journal of Complexity $v Roč. 25, č. 1 (2009), s. 63-74 $1 210 $c Elsevier
    541
    1-
    $a Složitost Gaussovských radiálních sítí $z cze
    610
    0-
    $a Gaussian-radial-basis-function networks
    610
    0-
    $a rates of approximation
    610
    0-
    $a model complexity
    610
    0-
    $a variation norms
    610
    0-
    $a Bessel and Sobolev norms
    610
    0-
    $a tractability of approximation
    700
    -1
    $3 cav_un_auth*0208442 $a Kainen $b P.C. $y US $4 070
    701
    -1
    $3 cav_un_auth*0100784 $a Kůrková $b Věra $p UIVT-O $w Department of Machine Learning $4 070 $T Ústav informatiky AV ČR, v. v. i.
    701
    -1
    $3 cav_un_auth*0020304 $a Sanguineti $b M. $y IT $4 070
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.