default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVera Kurková
- > Home > Persons > Vera Kurková
Publications
- 2023
[j43]Vera Kurková
, Marcello Sanguineti:
Approximation of classifiers by deep perceptron networks. Neural Networks 165: 654-661 (2023)- 2021
- [j42]Vera Kurková, Marcello Sanguineti:
Correlations of random classifiers on large data sets. Soft Comput. 25(19): 12641-12648 (2021) - 2019
- [j37]Vera Kurková, Marcello Sanguineti:
Classification by Sparse Neural Networks. IEEE Trans. Neural Networks Learn. Syst. 30(9): 2746-2754 (2019) - [c36]Vera Kurková, Marcello Sanguineti:
Probabilistic Bounds for Binary Classification of Large Data Sets. INNSBDDL 2019: 309-319 - 2018
- [c34]Vera Kurková, Marcello Sanguineti:
Probabilistic Bounds on Complexity of Networks Computing Binary Classification Tasks. ITAT 2018: 86-91 - 2017
- [j35]Vera Kurková, Marcello Sanguineti:
Probabilistic lower bounds for approximation by shallow perceptron networks. Neural Networks 91: 34-41 (2017) - 2016
- [j34]Vera Kurková, Marcello Sanguineti:
Model complexities of shallow networks representing highly varying functions. Neurocomputing 171: 598-604 (2016) - 2014
- [c26]Vera Kurková, Marcello Sanguineti:
Complexity of Shallow Networks Representing Functions with Large Variations. ICANN 2014: 331-338 - 2013
- [c25]Vera Kurková, Marcello Sanguineti:
Can Two Hidden Layers Make a Difference? ICANNGA 2013: 30-39 - [p4]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Approximating Multivariable Functions by Feedforward Neural Nets. Handbook on Neural Information Processing 2013: 143-181 - 2012
- [j32]Giorgio Gnecco, Vera Kurková, Marcello Sanguineti:
Accuracy of approximations of solutions to Fredholm equations by kernel methods. Appl. Math. Comput. 218(14): 7481-7497 (2012) - [j29]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks. IEEE Trans. Inf. Theory 58(2): 1203-1214 (2012) - 2011
- [j28]Giorgio Gnecco, Vera Kurková, Marcello Sanguineti:
Some comparisons of complexity in dictionary-based and linear computational models. Neural Networks 24(2): 171-182 (2011) - [j27]Giorgio Gnecco, Vera Kurková, Marcello Sanguineti:
Can dictionary-based computational models outperform the best linear ones? Neural Networks 24(8): 881-887 (2011) - [c21]Giorgio Gnecco, Vera Kurková, Marcello Sanguineti:
Bounds for Approximate Solutions of Fredholm Integral Equations Using Kernel Networks. ICANN (1) 2011: 126-133 - 2010
- [c19]Giorgio Gnecco, Vera Kurková, Marcello Sanguineti:
Some Comparisons of Model Complexity in Linear and Neural-Network Approximation. ICANN (3) 2010: 358-367 - 2009
- [j25]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Complexity of Gaussian-radial-basis networks approximating smooth functions. J. Complex. 25(1): 63-74 (2009) - [c15]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
On Tractability of Neural-Network Approximation. ICANNGA 2009: 11-21 - 2008
- [j23]Vera Kurková, Marcello Sanguineti:
Approximate Minimization of the Regularized Expected Error over Kernel Models. Math. Oper. Res. 33(3): 747-756 (2008) - [j21]Vera Kurková, Marcello Sanguineti:
Geometric Upper Bounds on Rates of Variable-Basis Approximation. IEEE Trans. Inf. Theory 54(12): 5681-5688 (2008) - [c13]Vera Kurková, Marcello Sanguineti:
Geometric Rates of Approximation by Neural Networks. SOFSEM 2008: 541-550 - 2007
- [j20]Vera Kurková, Marcello Sanguineti:
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets. Discret. Appl. Math. 155(15): 1930-1942 (2007) - [c12]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Estimates of Approximation Rates by Gaussian Radial-Basis Functions. ICANNGA (2) 2007: 11-18 - 2005
- [j17]Vera Kurková, Marcello Sanguineti:
Learning with generalization capability by kernel methods of bounded complexity. J. Complex. 21(3): 350-367 (2005) - [j16]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions. J. Math. Model. Algorithms 4(4): 355-368 (2005) - [j15]Vera Kurková, Marcello Sanguineti:
Error Estimates for Approximate Optimization by the Extended Ritz Method. SIAM J. Optim. 15(2): 461-487 (2005) - 2004
- [j14]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Minimization of Error Functionals over Variable-Basis Functions. SIAM J. Optim. 14(3): 732-742 (2004) - 2003
- [c10]Vera Kurková, Marcello Sanguineti:
Neural network learning as approximate optimization. ICANNGA 2003: 53-57 - 2002
- [j12]Vera Kurková, Marcello Sanguineti:
Comparison of worst case errors in linear and neural network approximation. IEEE Trans. Inf. Theory 48(1): 264-275 (2002) - 2001
- [j10]Vera Kurková, Marcello Sanguineti:
Bounds on rates of variable-basis and neural-network approximation. IEEE Trans. Inf. Theory 47(6): 2659-2665 (2001) - [c9]Vera Kurková, Marcello Sanguineti:
Tight Bounds on Rates of Neural-Network Approximation. ICANN 2001: 277-284 - 2000
- [c8]Vera Kurková, Marcello Sanguineti:
Comparison of Rates of Linear and Neural Network Approximation. IJCNN (1) 2000: 277-282
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
