The SCEAS System
| |||||||

## Search the dblp DataBase
Shahar Mendelson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Peter L. Bartlett, Shahar Mendelson
**Rademacher and Gaussian Complexities: Risk Bounds and Structural Results.**[Citation Graph (0, 0)][DBLP] COLT/EuroCOLT, 2001, pp:224-240 [Conf] - Peter L. Bartlett, Shahar Mendelson, Petra Philips
**Local Complexities for Empirical Risk Minimization.**[Citation Graph (0, 0)][DBLP] COLT, 2004, pp:270-284 [Conf] - Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson
**Localized Rademacher Complexities.**[Citation Graph (0, 0)][DBLP] COLT, 2002, pp:44-58 [Conf] - Shahar Mendelson
**Geometric Methods in the Analysis of Glivenko-Cantelli Classes.**[Citation Graph (0, 0)][DBLP] COLT/EuroCOLT, 2001, pp:256-272 [Conf] - Shahar Mendelson
**Learning Relatively Small Classes.**[Citation Graph (0, 0)][DBLP] COLT/EuroCOLT, 2001, pp:273-288 [Conf] - Shahar Mendelson
**Geometric Parameters of Kernel Machines.**[Citation Graph (0, 0)][DBLP] COLT, 2002, pp:29-43 [Conf] - Shahar Mendelson
**On the Limitations of Embedding Methods.**[Citation Graph (0, 0)][DBLP] COLT, 2005, pp:353-365 [Conf] - Shahar Mendelson, Petra Philips
**Random Subclass Bounds.**[Citation Graph (0, 0)][DBLP] COLT, 2003, pp:329-343 [Conf] - Shahar Mendelson, A. Pajor
**Ellipsoid Approximation Using Random Vectors.**[Citation Graph (0, 0)][DBLP] COLT, 2005, pp:429-443 [Conf] - Shahar Mendelson, Naftali Tishby
**Statistical Sufficiency for Classes in Empirical L**[Citation Graph (0, 0)][DBLP]_{2}Spaces. COLT, 2000, pp:81-89 [Conf] - Shahar Mendelson, Roman Vershynin
**Entropy, Combinatorial Dimensions and Random Averages.**[Citation Graph (0, 0)][DBLP] COLT, 2002, pp:14-28 [Conf] - Shahar Mendelson, Robert C. Williamson
**Agnostic Learning Nonconvex Function Classes.**[Citation Graph (0, 0)][DBLP] COLT, 2002, pp:1-13 [Conf] - Shahar Mendelson
**A Few Notes on Statistical Learning Theory.**[Citation Graph (0, 0)][DBLP] Machine Learning Summer School, 2002, pp:1-40 [Conf] - Shahar Mendelson, A. Pajor, M. Rudelson
**The Geometry of Random {-1, 1}-Polytopes.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2005, v:34, n:3, pp:365-379 [Journal] - Shahar Mendelson
**Learnability in Hilbert Spaces with Reproducing Kernels.**[Citation Graph (0, 0)][DBLP] J. Complexity, 2002, v:18, n:1, pp:152-170 [Journal] - Peter L. Bartlett, Shahar Mendelson
**Rademacher and Gaussian Complexities: Risk Bounds and Structural Results.**[Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2002, v:3, n:, pp:463-482 [Journal] - Shahar Mendelson
**On the Size of Convex Hulls of Small Sets.**[Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2001, v:2, n:, pp:1-18 [Journal] - Shahar Mendelson
**On the Performance of Kernel Classes.**[Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2003, v:4, n:, pp:759-771 [Journal] - Shahar Mendelson, Petra Philips
**On the Importance of Small Coordinate Projections.**[Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2004, v:5, n:, pp:219-238 [Journal] - Shahar Mendelson
**A New On-Line Learning Model.**[Citation Graph (0, 0)][DBLP] Neural Computation, 2001, v:13, n:4, pp:935-957 [Journal] - Shahar Mendelson
**Embedding with a Lipschitz function.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:27, n:1, pp:25-45 [Journal] - Shahar Mendelson
**Rademacher averages and phase transitions in Glivenko-Cantelli classes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:251-263 [Journal] - Shahar Mendelson
**Improving the sample complexity using global data.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:1977-1991 [Journal] **Complexity measures of sign matrices.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

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