Schnelleinstieg Reader

Home|Suche|Sitemap|Webmail

Startseite FSU




soeren_laue

Sören Laue

Senior Researcher

Lehrstuhl für Theoretische Informatik II
Fakultät für Mathematik und Informatik
Friedrich-Schiller-Universität Jena

Ernst-Abbe-Platz 2
D-07743 Jena
Germany

Office: 3311
Phone: +49 3641 9 46317
Fax: +49 3641 9 46322
Email: soeren.laue at uni-jena dot de


Research Interests


  • Optimization Algorithms for Machine Learning

Publications


My favorite paper:

  • S. Laue
    A Hybrid Algorithm for Convex Semidefinite Optimization, ICML 2012.
    [PDF] [talk]

In chronological order:

  • K. Blechschmidt, J. Giesen, and S. Laue
    Tracking of Approximate Solutions of Parameterized Optimization Problems over Multi-Dimensional (Hyper-)Parameter Domains, ICML 2015.
    [PDF]   [talk]

  • S. Jelic, S. Laue, D. Matijevic, and P. Wijerama
    A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs.
    Intl. Journal of Parallel Programming, 43(5):840-875, 2015.

  • J. Giesen, S. Laue, and P. Wieschollek
    Robust and Efficient Kernel Hyperparameter Paths with Guarantees
    , ICML 2014.
    [PDF]   [talk]

  • J. Giesen, L. Kühne, and S. Laue
    Sketching the Support of a Probability Measure, AISTATS 2014.
    [PDF]

  • S. Laue
    A Hybrid Algorithm for Convex Semidefinite Optimization, ICML 2012.
    [PDF]   [talk]

  • J. Giesen, S. Laue, J. Mueller, S. Swiercy
    Approximating Concavely Parameterized Optimization Problems, NIPS 2012.
    [PDF]   [talk]
     
  • J. Giesen, M. Jaggi, and S. Laue
    Optimizing over the Growing Spectrahedron, ESA 2012.
    [PDF]

  • J. Giesen, M. Jaggi, and S. Laue
    Regularization Paths with Guarantees for Convex Semidefinite Optimization, AISTATS 2012.
    [PDF]

  • G. Dinu, S. Thater, and S. Laue
    A Comparison of Models of Word Meaning in Context, NAACL 2012.
    [PDF]

  • J. Giesen, M. Jaggi, and S. Laue
    Approximating Parameterized Convex Optimization Problems
    ACM Transactions on Algorithms, 9(1):10, 2012.

    An extended abstract appeared as:
    Approximating Parameterized Convex Optimization Problems, ESA 2010.
    [PDF]

  • S. Laue
    Geometric Set Cover and Hitting Sets for Polytopes in R^3, STACS 2008.
    [PDF]

  • S. Funke , S. Laue, R. Naujoks , and Z. Lotker
    Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours.
    Ad Hoc Networks 9(6): 1028-1035, 2011.
    [PDF]

    An extended abstract appeared as:
    Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-efficient Travelling Salesman Tours, DCOSS 2008.
    [PDF]

  • S. Laue and D. Matijevic
    Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
    Information Processing Letters, 107/3-4:96-101, 2008.
    [PDF]

    An extended abstract appeared as:
    Approximating k-hop Minimum Spanning Trees in Euclidean Metrics, CCCG 2007.
    [PDF]

  • S. Funke , S. Laue, and R. Naujoks
    Minimum-Energy Broadcast with Few Senders, DCOSS 2007.
    [PDF]

  • S. Funke and S. Laue.
    Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets, STACS 2007.
    [PDF]

  • F. Eisenbrand and S. Laue.
    A linear algorithm for integer programming in the plane.
    Mathematical Programming, 102(2):249-259, 2005.
    [PDF]

    An extended abstract appeared as:
    A faster algorithm for two variable integer programming, ISAAC 2003.
    [PDF]


Teaching



Education


blogger counter