A- A A+ EnglishDeutsch

Event Calendar:

May 2012
	Mo	Tu	We	Th	Fr	Sa	Su
18	30	01	02	03	04	05	06
19	07	08	09	10	11	12	13
20	14	15	16	17	18	19	20
21	21	22	23	24	25	26	27
22	28	29	30	31	01	02	03

Quick Links

Contact

Prof. Jeff Bilmes

Address:	Spemannstr. 38 Tübingen
E-Mail:	jeff.bilmes

Print page

Picture of Bilmes, Jeff, Prof.

Jeff Bilmes

Position: Research Scientist Unit: Alumni Schölkopf

Publications

Conference papers (7):
•	Jegelka S , Lin H and Bilmes J (January-2012) On Fast Approximate Submodular Minimization In: Advances in Neural Information Processing Systems 24, Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS 2011), 460-468.
•	Jegelka S and Bilmes J (July-2011) Approximation Bounds for Inference using Cooperative Cut 28th International Conference on Machine Learning (ICML 2011), International Machine Learning Society, Madison, WI, USA, 577-584.
•	Jegelka S and Bilmes J (July-2011) Online submodular minimization for combinatorial structures 28th International Conference on Machine Learning (ICML 2011), International Machine Learning Society, Madison, WI, USA, 345-352.
•	Jegelka S and Bilmes J (June-2011) Multi-label cooperative cuts CVPR 2011 Workshop on Inference in Graphical Models with Structured Potentials, 1-4.
•	Jegelka S and Bilmes J (June-2011) Submodularity beyond submodular energies: coupling edges in graph cuts IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011), IEEE, Piscataway, NJ, USA, 1897-1904.
•	Jegelka S and Bilmes J (December-2010) Online algorithms for submodular minimization with combinatorial constraints NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML), 1-6.
•	Jegelka S and Bilmes J (December-2009) Notes on Graph Cuts with Submodular Edge Weights NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & Polyhedra (DISCML), 1-6.
Technical reports (2):
•	Jegelka S and Bilmes J : Cooperative Cuts for Image Segmentation, UWEETR-1020-0003, University of Washington, Washington, DC, USA, (August-2010).
•	Jegelka S and Bilmes J : Cooperative Cuts: Graph Cuts with Submodular Edge Weights, 189, Max Planck Institute for Biological Cybernetics, Tuebingen, Germany, (March-2010).
Talks (1):
•	Jegelka S and Bilmes J (July-2010): Cooperative Cuts: Graph Cuts with Submodular Edge Weights, 24th European Conference on Operational Research (EURO XXIV), Lisboa, Portugal.

Export as:

BibTeX, XML, Pubman, Edoc

Last updated: Monday, 16.01.2012