Publications of J Bilmes

Conference Paper (7)

1.
Conference Paper
Jegelka, S.; Lin, H.; Bilmes, J.: On Fast Approximate Submodular Minimization. In: Advances in Neural Information Processing Systems 24, pp. 460 - 468 (Eds. Shawe-Taylor, J.; Zemel, R.; Bartlett, P.; Pereira, F.; Weinberger, K.). Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS 2011), Granada, Spain. Curran, Red Hook, NY, USA (2012)
2.
Conference Paper
Jegelka, S.; Bilmes, J.: Approximation Bounds for Inference using Cooperative Cut. In: 28th International Conference on Machine Learning (ICML 2011), pp. 577 - 584 (Eds. Getoor, L.; Scheffer, T.). 28th International Conference on Machine Learning (ICML 2011), Bellevue, WA, USA. International Machine Learning Society, Madison, WI, USA (2011)
3.
Conference Paper
Jegelka, S.; Bilmes, J.: Online submodular minimization for combinatorial structures. In: 28th International Conference on Machine Learning (ICML 2011), pp. 345 - 352 (Eds. Getoor, L.; Scheffer, T.). 28th International Conference on Machine Learning (ICML 2011), Bellevue, WA, USA. International Machine Learning Society, Madison, WI, USA (2011)
4.
Conference Paper
Jegelka, S.; Bilmes, J.: Multi-label cooperative cuts. In: CVPR 2011 Workshop on Inference in Graphical Models with Structured Potentials, pp. 1 - 4. CVPR 2011 Workshop on Inference in Graphical Models with Structured Potentials, Colorado Springs, CO, USA. (2011)
5.
Conference Paper
Jegelka, S.; Bilmes, J.: Submodularity beyond submodular energies: coupling edges in graph cuts. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011), pp. 1897 - 1904. IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011), Colorado Springs, CO, USA, June 20, 2011 - June 25, 2011. IEEE, Piscataway, NJ, USA (2011)
6.
Conference Paper
Jegelka, S.; Bilmes, J.: Online algorithms for submodular minimization with combinatorial constraints. In: NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML), pp. 1 - 6. NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML), Whistler, BC, Canada, December 11, 2010. (2010)
7.
Conference Paper
Jegelka, S.; Bilmes, J.: Notes on Graph Cuts with Submodular Edge Weights. In: NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & Polyhedra (DISCML), pp. 1 - 6. NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity Polyhedra (DISCML), Whistler, BC, Canada. (2009)

Meeting Abstract (1)

8.
Meeting Abstract
Jegelka, S.; Bilmes, J.: Cooperative Cuts: Graph Cuts with Submodular Edge Weights. In 24th European Conference on Operational Research (EURO XXIV), p. 171. 24th European Conference on Operational Research (EURO XXIV), Lisboa, Portugal, July 11, 2010 - July 14, 2010. (2010)

Report (2)

9.
Report
Jegelka, S.; Bilmes, J.: Cooperative Cuts for Image Segmentation (UWEE Technical Report, UWEETR-1020-0003). Department of Electrical Engineering, University of Washington, Seattle, WA, USA (2010), 21 pp.
10.
Report
Jegelka, S.; Bilmes, J.: Cooperative Cuts: Graph Cuts with Submodular Edge Weights (Technical Report of the Max Planck Institute for Biological Cybernetics, 189). Max Planck Institute for Biological Cybernetics, Tübingen, Germany (2010), 32 pp.
Go to Editor View