Ei_header
Nobody
Jeff Bilmes
Prof.
Position: Research Scientist

Export search results as: [BibTex]

2011
Conference Papers
  • S. Jegelka, J. Bilmes (2011). Online submodular minimization for combinatorial structures (Ed) Getoor, L. , T. Scheffer, International Machine Learning Society, Madison, WI, USA, 345-352, ISBN: 978-1-450-30619-5, 28th International Conference on Machine Learning (ICML 2011)
  • S. Jegelka, H. Lin, J. Bilmes (2011). On Fast Approximate Submodular Minimization In: Advances in Neural Information Processing Systems 24, (Ed) J Shawe-Taylor and RS Zemel and P Bartlett and F Pereira and KQ Weinberger, 460-468, Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS 2011)
  • S. Jegelka, J. Bilmes (2011). Submodularity beyond submodular energies: coupling edges in graph cuts IEEE, Piscataway, NJ, USA, 1897-1904, ISBN: 978-1-4577-0394-2 , IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011)
  • S. Jegelka, J. Bilmes (2011). Approximation Bounds for Inference using Cooperative Cut (Ed) Getoor, L. , T. Scheffer, International Machine Learning Society, Madison, WI, USA, 577-584, ISBN: 978-1-450-30619-5, 28th International Conference on Machine Learning (ICML 2011)
2010
Talks
Technical Reports
Conference Papers
  • S. Jegelka, J. Bilmes (2010). Online algorithms for submodular minimization with combinatorial constraints 1-6, NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML)
2009
Conference Papers
  • S. Jegelka, J. Bilmes (2009). Notes on Graph Cuts with Submodular Edge Weights 1-6, NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & Polyhedra (DISCML)