default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaly Maiorov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
[j20]Vitaly Maiorov:
Geometric properties of the ridge function manifold. Adv. Comput. Math. 32(2): 239-253 (2010)- 2009
- [j19]Viktor N. Konovalov, Dany Leviatan, V. E. Maiorov:
Approximation of Sobolev classes by polynomials and ridge functions. J. Approx. Theory 159(1): 97-108 (2009) - 2008
- [j18]Viktor N. Konovalov, Dany Leviatan, V. E. Maiorov:
Approximation by polynomials and ridge functions of classes of s-monotone radial functions. J. Approx. Theory 152(1): 20-51 (2008) - 2006
- [j17]Vitaly Maiorov:
Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary. Adv. Comput. Math. 25(4): 435-450 (2006) - [j16]Vitaly Maiorov:
Approximation by neural networks and learning theory. J. Complex. 22(1): 102-117 (2006) - 2005
- [j15]Vitaly Maiorov:
On lower bounds in radial basis approximation. Adv. Comput. Math. 22(2): 103-113 (2005) - 2003
- [j14]Vitaly Maiorov:
On best approximation of classes by radial functions. J. Approx. Theory 120(1): 36-70 (2003) - 2001
- [j13]Vitaly Maiorov, Ron Meir:
Lower bounds for multivariate approximation by affine-invariant dictionaries. IEEE Trans. Inf. Theory 47(4): 1569-1575 (2001) - 2000
- [j12]Vitaly Maiorov, Ron Meir:
On the near optimality of the stochastic approximation of smooth functions by neural networks. Adv. Comput. Math. 13(1): 79-103 (2000) - [j11]Ron Meir, V. E. Maiorov:
On the optimality of neural-network approximation using incremental algorithms. IEEE Trans. Neural Networks Learn. Syst. 11(2): 323-337 (2000) - 1999
- [j10]Vitaly Maiorov, Allan Pinkus:
Lower bounds for approximation by MLP neural networks. Neurocomputing 25(1-3): 81-91 (1999) - [j9]Joel Ratsaby, Vitaly Maiorov:
On the Learnability of Rich Function Classes. J. Comput. Syst. Sci. 58(1): 183-192 (1999) - [j8]Ron Meir, Vitaly Maiorov:
Distortion bounds for vector quantizers with finite codebook size. IEEE Trans. Inf. Theory 45(5): 1621-1631 (1999) - 1998
- [j7]Vitaly Maiorov, Joel Ratsaby:
The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension. Discret. Appl. Math. 86(1): 81-93 (1998) - [j6]Peter L. Bartlett, Vitaly Maiorov, Ron Meir:
Almost Linear VC-Dimension Bounds for Piecewise Polynomial Networks. Neural Comput. 10(8): 2159-2173 (1998) - [j5]Assaf J. Zeevi, Ron Meir, Vitaly Maiorov:
Error Bounds for Functional Approximation and Estimation Using Mixtures of Experts. IEEE Trans. Inf. Theory 44(3): 1010-1025 (1998) - [j4]V. E. Maiorov, R. S. Meir:
Approximation bounds for smooth functions in C(Rd) by neural and mixture networks. IEEE Trans. Neural Networks 9(5): 969-978 (1998) - 1997
- [j3]Joel Ratsaby, Vitaly Maiorov:
On the Value of Partial Information for Learning from Examples. J. Complex. 13(4): 509-543 (1997) - 1996
- [j2]Vitaly Maiorov:
About Widths of Wiener Space in the Lq-Norm. J. Complex. 12(1): 47-57 (1996) - 1993
- [j1]Vitaly Maiorov:
Average n-Widths of the Wiener Space in the Linfinity-Norm. J. Complex. 9(2): 222-230 (1993)
Conference and Workshop Papers
- 1998
- [c4]Peter L. Bartlett, Vitaly Maiorov, Ron Meir:
Almost Linear VC Dimension Bounds for Piecewise Polynomial Networks. NIPS 1998: 190-196 - [c3]Ron Meir, Vitaly Maiorov:
On the Optimality of Incremental Neural Network Algorithms. NIPS 1998: 295-301 - 1997
- [c2]Joel Ratsaby, Vitaly Maiorov:
Generalization of the PAC-Model for Learning with Partial Information. EuroCOLT 1997: 51-65 - 1996
- [c1]Joel Ratsaby, Ron Meir, Vitaly Maiorov:
Towards Robust Model Selection Using Estimation and Approximation Error Bounds. COLT 1996: 57-67
Coauthor Index
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-04-24 22:54 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:
