From post

Bounds for Approximate Solutions of Fredholm Integral Equations Using Kernel Networks.

, , и . ICANN (1), том 6791 из Lecture Notes in Computer Science, стр. 126-133. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Estimates of Network Complexity and Integral Representations., и . ICANN (1), том 5163 из Lecture Notes in Computer Science, стр. 31-40. Springer, (2008)Probabilistic Bounds for Approximation by Neural Networks.. ICANN (1), том 11727 из Lecture Notes in Computer Science, стр. 418-428. Springer, (2019)Functionally Equivalent Feedforward Neural Networks., и . Neural Comput., 6 (3): 543-558 (1994)Representations of Highly-Varying Functions by One-Hidden-Layer Networks.. ICAISC (1), том 8467 из Lecture Notes in Computer Science, стр. 67-76. Springer, (2014)Limitations of One-Hidden-Layer Perceptron Networks.. ITAT, том 1422 из CEUR Workshop Proceedings, стр. 167-171. CEUR-WS.org, (2015)Some Comparisons of Model Complexity in Linear and Neural-Network Approximation., , и . ICANN (3), том 6354 из Lecture Notes in Computer Science, стр. 358-367. Springer, (2010)Comparison of Rates of Linear and Neural Network Approximation., и . IJCNN (1), стр. 277-282. IEEE Computer Society, (2000)Networks with Finite VC Dimension: Pro and Contra., и . CoRR, (февраля 2025)Lower Bounds on Complexity of Shallow Perceptron Networks.. EANN, том 629 из Communications in Computer and Information Science, стр. 283-294. Springer, (2016)Kernel Networks with Fixed and Variable Widths., и . ICANNGA (1), том 6593 из Lecture Notes in Computer Science, стр. 12-21. Springer, (2011)