The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vitaly Maiorov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joel Ratsaby, Ron Meir, Vitaly Maiorov
    Towards Robust Model Selection Using Estimation and Approximation Error Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:57-67 [Conf]
  2. Joel Ratsaby, Vitaly Maiorov
    Generalization of the PAC-Model for Learning with Partial Information. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:51-65 [Conf]
  3. Peter L. Bartlett, Vitaly Maiorov, Ron Meir
    Almost Linear VC Dimension Bounds for Piecewise Polynomial Networks. [Citation Graph (0, 0)][DBLP]
    NIPS, 1998, pp:190-196 [Conf]
  4. Ron Meir, Vitaly Maiorov
    On the Optimality of Incremental Neural Network Algorithms. [Citation Graph (0, 0)][DBLP]
    NIPS, 1998, pp:295-301 [Conf]
  5. Vitaly Maiorov
    On lower bounds in radial basis approximation. [Citation Graph (0, 0)][DBLP]
    Adv. Comput. Math., 2005, v:22, n:2, pp:103-113 [Journal]
  6. Vitaly Maiorov, Joel Ratsaby
    The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:1, pp:81-93 [Journal]
  7. Vitaly Maiorov, Allan Pinkus
    Lower bounds for approximation by MLP neural networks. [Citation Graph (0, 0)][DBLP]
    Neurocomputing, 1999, v:25, n:1-3, pp:81-91 [Journal]
  8. Vitaly Maiorov
    On best approximation of classes by radial functions. [Citation Graph (0, 0)][DBLP]
    Journal of Approximation Theory, 2003, v:120, n:1, pp:36-70 [Journal]
  9. Vitaly Maiorov
    Approximation by neural networks and learning theory. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:1, pp:102-117 [Journal]
  10. Vitaly Maiorov
    Average n-Widths of the Wiener Space in the Linfinity-Norm. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:2, pp:222-230 [Journal]
  11. Vitaly Maiorov
    About Widths of Wiener Space in the Lq-Norm. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1996, v:12, n:1, pp:47-57 [Journal]
  12. Joel Ratsaby, Vitaly Maiorov
    On the Value of Partial Information for Learning from Examples. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:4, pp:509-543 [Journal]
  13. Joel Ratsaby, Vitaly Maiorov
    On the Learnability of Rich Function Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:183-192 [Journal]
  14. Peter L. Bartlett, Vitaly Maiorov, Ron Meir
    Almost Linear VC-Dimension Bounds for Piecewise Polynomial Networks. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1998, v:10, n:8, pp:2159-2173 [Journal]
  15. Vitaly Maiorov, Ron Meir
    Lower bounds for multivariate approximation by affine-invariant dictionaries. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1569-1575 [Journal]
  16. Ron Meir, Vitaly Maiorov
    Distortion bounds for vector quantizers with finite codebook size. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1621-1631 [Journal]
  17. Assaf J. Zeevi, Ron Meir, Vitaly Maiorov
    Error Bounds for Functional Approximation and Estimation Using Mixtures of Experts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1010-1025 [Journal]

  18. On the near optimality of the stochastic approximation of smooth functions by neural networks. [Citation Graph (, )][DBLP]


  19. Geometric properties of the ridge function manifold. [Citation Graph (, )][DBLP]


Search in 0.100secs, Finished in 0.101secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002