Refine my results

Institution

  • Valais disable the filter

Specific Collection

Language

Consortium of Swiss Academic Libraries

Fast Update of Conditional Simulation Ensembles

Chevalier, Clément ; Emery, Xavier ; Ginsbourger, David

In: Mathematical Geosciences, 2015, vol. 47, no. 7, p. 771-789

Università della Svizzera italiana

Scalable algorithms for high-dimensional graphical lasso and function approximation

Eftekhari, Aryan ; Schenk, Olaf (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2021 ; 2021INFO008.

Fundamental tasks in multivariate and numerical analysis, such as sparse precision matrix estimation via graphical lasso and function approximation, are formulated in ever-increasing dimensions. Consequently, this results in a significant increase in the computational demand that quickly renders standard solution methods intractable. With this motivation, we present two scalable algorithms that...

Università della Svizzera italiana

Multilevel minimization in trust-region framework : algorithmic and software developments

Kopaničáková, Alena ; Krause, Rolf (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2020 ; 2020INFO021.

The field of scientific computing is associated with the modeling of complex physical phenomena. The resulting numerical models are often described by differential equations, which, in many cases, can be related to non-convex minimization problems. Thus, after discretization, the solution of large-scale non-convex optimization problem is required. Various iterative solution strategies can be...

Université de Fribourg

Characterizations of cographs as intersection graphs of paths on a grid

Cohen, Elad ; Golumbic, Martin Charles ; Ries, Bernard

In: Discrete Applied Mathematics, 2014, vol. 178, p. 46-57

A cograph is a graph which does not contain any induced path on four vertices. In this paper, we characterize those cographs that are intersection graphs of paths on a grid in the following two cases: (i) the paths on the grid all have at most one bend and the intersections concern edges (→ B1-EPG); (ii) the paths on the grid are not bended and the intersections concern vertices (→...