Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach

ISSN： 0885-064X

Source： Journal of Complexity, Vol.17, Iss.2, 2001-06, pp. : 345-365

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The fuzzy neural network approximation lemma

By Feuring T. Lippe W.-M.

Fuzzy Sets and Systems, Vol. 102, Iss. 2, 1999-03 ,pp. : 227-236

Elsevier

Access to resources Recommend Favorite

Worst case complexity of multivariate Feynman-Kac path integration

By Kwas M. Li Y.

Journal of Complexity, Vol. 19, Iss. 6, 2003-12 ,pp. : 730-743

Elsevier

Access to resources Recommend Favorite

Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization

By Garmanjani R. Vicente L. N.

IMA Journal of Numerical Analysis, Vol. 33, Iss. 3, 2013-07 ,pp. : 1008-1028

Oxford University Press

Access to resources Recommend Favorite

On the Exact Worst Case Query Complexity of Planar Point Location

By Seidel R. Adamy U.

Journal of Algorithms, Vol. 37, Iss. 1, 2000-10 ,pp. : 189-217

Academic Press

Access to resources Recommend Favorite

A New Algorithm and Worst Case Complexity for Feynman–Kac Path Integration

By Plaskota L. Wasilkowski G.W. Woźniakowski H.

Journal of Computational Physics, Vol. 164, Iss. 2, 2000-11 ,pp. : 335-353

Academic Press

Access to resources Recommend Favorite