The SCEAS System
Navigation Menu

Search the dblp DataBase


Nathan Srebro: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nathan Srebro, Shai Ben-David
    Learning Bounds for Support Vector Machines with Learned Kernels. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:169-183 [Conf]
  2. Nathan Srebro, Adi Shraibman
    Rank, Trace-Norm and Max-Norm. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:545-560 [Conf]
  3. Jason D. M. Rennie, Nathan Srebro
    Fast maximum margin matrix factorization for collaborative prediction. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:713-719 [Conf]
  4. Nathan Srebro, Tommi Jaakkola
    Weighted Low-Rank Approximations. [Citation Graph (0, 0)][DBLP]
    ICML, 2003, pp:720-727 [Conf]
  5. Nathan Srebro, Gregory Shakhnarovich, Sam Roweis
    An investigation of computational and informational limits in Gaussian mixture clustering. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:865-872 [Conf]
  6. Nathan Srebro, Noga Alon, Tommi Jaakkola
    Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  7. Nathan Srebro, Tommi Jaakkola
    Linear Dependent Dimensionality Reduction. [Citation Graph (0, 0)][DBLP]
    NIPS, 2003, pp:- [Conf]
  8. Nathan Srebro, Jason D. M. Rennie, Tommi Jaakkola
    Maximum-Margin Matrix Factorization. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  9. David R. Karger, Nathan Srebro
    Learning Markov networks: maximum bounded tree-width graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:392-401 [Conf]
  10. Nathan Srebro
    Maximum Likelihood Bounded Tree-Width Markov Networks. [Citation Graph (0, 0)][DBLP]
    UAI, 2001, pp:504-511 [Conf]
  11. Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Angèle M. Hamel, Tommi Jaakkola, Nathan Srebro
    K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:506-520 [Conf]
  12. Nathan Srebro
    Maximum likelihood bounded tree-width Markov networks. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:143, n:1, pp:123-138 [Journal]
  13. Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Nathan Srebro, Angèle M. Hamel, Tommi Jaakkola
    K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:9, pp:1070-1078 [Journal]
  14. Nathan Srebro
    How Good Is a Kernel When Used as a Similarity Measure? [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:323-335 [Conf]
  15. Saharon Rosset, Grzegorz Swirszcz, Nathan Srebro, Ji Zhu
    l1 Regularization in Infinite Dimensional Feature Spaces. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:544-558 [Conf]
  16. Nathan Srebro
    Are There Local Maxima in the Infinite-Sample Likelihood of Gaussian Mixture Estimation? [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:628-629 [Conf]
  17. Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro
    Pegasos: Primal Estimated sub-GrAdient SOlver for SVM. [Citation Graph (0, 0)][DBLP]
    ICML, 2007, pp:807-814 [Conf]
  18. Yonatan Amit, Michael Fink 0002, Nathan Srebro, Shimon Ullman
    Uncovering shared structures in multiclass classification. [Citation Graph (0, 0)][DBLP]
    ICML, 2007, pp:17-24 [Conf]

  19. Improved Guarantees for Learning via Similarity Functions. [Citation Graph (, )][DBLP]

  20. SVM optimization: inverse dependence on training set size. [Citation Graph (, )][DBLP]

  21. Fast Rates for Regularized Objectives. [Citation Graph (, )][DBLP]

  22. Complexity of Inference in Graphical Models. [Citation Graph (, )][DBLP]

  23. Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm [Citation Graph (, )][DBLP]

Search in 0.019secs, Finished in 0.021secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002