The SCEAS System
| |||||||

## Search the dblp DataBase
Vitaly Maiorov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - Ron Meir, Vitaly Maiorov
**On the Optimality of Incremental Neural Network Algorithms.**[Citation Graph (0, 0)][DBLP] NIPS, 1998, pp:295-301 [Conf] - 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] - 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] - 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] - 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] - 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] - Vitaly Maiorov
**Average**[Citation Graph (0, 0)][DBLP]*n*-Widths of the Wiener Space in the*L*_{infinity}-Norm. J. Complexity, 1993, v:9, n:2, pp:222-230 [Journal] - Vitaly Maiorov
**About Widths of Wiener Space in the**[Citation Graph (0, 0)][DBLP]*L*-Norm._{q} J. Complexity, 1996, v:12, n:1, pp:47-57 [Journal] - 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] - 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] - 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] - 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] - 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] - 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] **On the near optimality of the stochastic approximation of smooth functions by neural networks.**[Citation Graph (, )][DBLP]**Geometric properties of the ridge function manifold.**[Citation Graph (, )][DBLP]
Search in 0.100secs, Finished in 0.101secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |