Header logo is


2016


no image
Supplemental material for ’Communication Rate Analysis for Event-based State Estimation’

Ebner, S., Trimpe, S.

Max Planck Institute for Intelligent Systems, January 2016 (techreport)

am ics

PDF [BibTex]

2016


PDF [BibTex]


no image
Statische und dynamische Magnetisierungseigenschaften nanoskaliger Überstrukturen

Gräfe, J.

Universität Stuttgart, Stuttgart (und Cuvillier Verlag, Göttingen), 2016 (phdthesis)

mms

[BibTex]

[BibTex]


no image
Gepinnte Bahnmomente in magnetischen Heterostrukturen

Audehm, P.

Universität Stuttgart, Stuttgart (und Cuvillier Verlag, Göttingen), 2016 (phdthesis)

mms

[BibTex]

[BibTex]


no image
Austauschgekoppelte Moden in magnetischen Vortexstrukturen

Dieterle, G.

Universität Stuttgart, Stuttgart, 2016 (phdthesis)

mms

[BibTex]

[BibTex]


no image
Density matrix calculations for the ultrafast demagnetization after femtosecond laser pulses

Weng, Weikai

Universität Stuttgart, Stuttgart, 2016 (mastersthesis)

mms

[BibTex]

[BibTex]


no image
Helium und Hydrogen Isotope Adsorption and Separation in Metal-Organic Frameworks

Zaiser, Ingrid

Universität Stuttgart, Stuttgart (und Cuvillier Verlag, Göttingen), 2016 (phdthesis)

mms

[BibTex]

[BibTex]

2013


Learning and Optimization with Submodular Functions
Learning and Optimization with Submodular Functions

Sankaran, B., Ghazvininejad, M., He, X., Kale, D., Cohen, L.

ArXiv, May 2013 (techreport)

Abstract
In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be computed tractably, it is beneficial to have strong guarantees on the tractable approximate solutions. In order operate under these criterion most optimization problems are cast under the umbrella of convexity or submodularity. In this report we will study design and optimization over a common class of functions called submodular functions. Set functions, and specifically submodular set functions, characterize a wide variety of naturally occurring optimization problems, and the property of submodularity of set functions has deep theoretical consequences with wide ranging applications. Informally, the property of submodularity of set functions concerns the intuitive principle of diminishing returns. This property states that adding an element to a smaller set has more value than adding it to a larger set. Common examples of submodular monotone functions are entropies, concave functions of cardinality, and matroid rank functions; non-monotone examples include graph cuts, network flows, and mutual information. In this paper we will review the formal definition of submodularity; the optimization of submodular functions, both maximization and minimization; and finally discuss some applications in relation to learning and reasoning using submodular functions.

am

arxiv link (url) [BibTex]

2013


arxiv link (url) [BibTex]


no image
Quantum kinetic theory for demagnetization after femtosecond laser pulses

Teeny, N.

Universität Stuttgart, Stuttgart, 2013 (mastersthesis)

mms

[BibTex]

[BibTex]


no image
Statics and dynamics of simple fluids on chemically patterned substrates

Dörfler, F.

Universität Stuttgart, Stuttgart, Germany, 2010 (phdthesis)

mms

link (url) [BibTex]

link (url) [BibTex]


no image
Entnetzung verspannter Filme

Reindl, A.

Universität Stuttgart, Stuttgart, 2010 (mastersthesis)

mms

[BibTex]

[BibTex]


no image
Advanced ferromagnetic nanostructures

Goll, D.

Universität Stuttgart, Stuttgart, 2010 (phdthesis)

mms

[BibTex]

[BibTex]


no image
Wasserstoff in funktionellen Dünnschichtsystemen

Honert, J.

Universität Stuttgart, Stuttgart, 2010 (mastersthesis)

mms

[BibTex]

[BibTex]