Publikationen von J Bilmes

Konferenzbeitrag (7)

1.
Konferenzbeitrag
Jegelka, S.; Lin, H.; Bilmes, J.: On Fast Approximate Submodular Minimization. In: Advances in Neural Information Processing Systems 24, S. 460 - 468 (Hg. 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.
Konferenzbeitrag
Jegelka, S.; Bilmes, J.: Approximation Bounds for Inference using Cooperative Cut. In: 28th International Conference on Machine Learning (ICML 2011), S. 577 - 584 (Hg. Getoor, L.; Scheffer, T.). 28th International Conference on Machine Learning (ICML 2011), Bellevue, WA, USA. International Machine Learning Society, Madison, WI, USA (2011)
3.
Konferenzbeitrag
Jegelka, S.; Bilmes, J.: Online submodular minimization for combinatorial structures. In: 28th International Conference on Machine Learning (ICML 2011), S. 345 - 352 (Hg. Getoor, L.; Scheffer, T.). 28th International Conference on Machine Learning (ICML 2011), Bellevue, WA, USA. International Machine Learning Society, Madison, WI, USA (2011)
4.
Konferenzbeitrag
Jegelka, S.; Bilmes, J.: Multi-label cooperative cuts. In: CVPR 2011 Workshop on Inference in Graphical Models with Structured Potentials, S. 1 - 4. CVPR 2011 Workshop on Inference in Graphical Models with Structured Potentials, Colorado Springs, CO, USA. (2011)
5.
Konferenzbeitrag
Jegelka, S.; Bilmes, J.: Submodularity beyond submodular energies: coupling edges in graph cuts. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011), S. 1897 - 1904. IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011), Colorado Springs, CO, USA, 20. Juni 2011 - 25. Juni 2011. IEEE, Piscataway, NJ, USA (2011)
6.
Konferenzbeitrag
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), S. 1 - 6. NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML), Whistler, BC, Canada, 11. Dezember 2010. (2010)
7.
Konferenzbeitrag
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), S. 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), S. 171. 24th European Conference on Operational Research (EURO XXIV), Lisboa, Portugal, 11. Juli 2010 - 14. Juli 2010. (2010)

Bericht (2)

9.
Bericht
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 S.
10.
Bericht
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 S.
Zur Redakteursansicht