The computational structure of environmental life cycle costing

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

Nicolas Macris, Jean François Emmanuel Barbier

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast with most existin ...

AMER PHYSICAL SOC2022

DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast

Daniel Kressner, Stefano Massei, Alice Cortinovis

This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for performing low-rank up ...

SIAM PUBLICATIONS2022

LSSANet: A Long Short Slice-Aware Network for Pulmonary Nodule Detection

Bo Du, Jiancheng Yang, Rui Xu

Convolutional neural networks (CNNs) have been demonstrated to be highly effective in the field of pulmonary nodule detection. However, existing CNN based pulmonary nodule detection methods lack the ability to capture long-range dependencies, which is vita ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

TimeEvolver: A program for time evolution with improved error bound

Sebastian Zell

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

ELSEVIER2022

Multi-physics modeling of VVERs with high fidelity high-resolution codes

Marianna Papadionysiou

The calculations performed for the design and operation of a Nuclear Power Plant (NPP) are a key factor for their safety analyses. The standard for the computational analysis of NPPs is the so called conventional approach, which relies on coarse mesh diffu ...

EPFL2022

Construction of optimal spectral methods in phase retrieval

Florent Gérard Krzakala, Lenka Zdeborová

We consider the phase retrieval problem, in which the observer wishes to recover a n-dimensional real or complex signal X⋆ from the (possibly noisy) observation of |ΦX⋆|, in which Φ is a matrix of size m×n. We consider a \emph{high-dimensional} setting whe ...

2021

The Dimension of the Body in Higher Education: Matrix of Meanings in Students’ Diaries

Simon Nessim Henein, Ramiro Tau

In this paper, we attempt to show some consequences of bringing the body back into higher education, through the use of performing arts in the curricular context of scientific programs. We start by arguing that dominant traditions in higher education repro ...

2022

Reversible and Broad-Range Oxygen Sensing Based on Purely Organic Long-Lived Photoemitters

Esther Amstad, Efe Armagan, René M. Rossi

The detection of oxygen (O-2) by optical sensors is of growing importance, for example, in biology, life science, environmental science, and aerodynamics, where the composition of gases is crucial for many applications. Purely organic optical O-2 sensors a ...

2021

Efficient Learning of a Linear Dynamical System with Stability Guarantees

Daniel Kuhn, Tobias Sutter, Wouter Jongeneel

We propose a principled method for projecting an arbitrary square matrix to the non- convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an information-theoretic sense and ...

2023

Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems

Pascal Fua, Mathieu Salzmann, Fei Wang, Kwang Moo Yi, Zheng Dang, Yinlin Hu

Many classical Computer Vision problems, such as essential matrix computation and pose estimation from 3D to 2D correspondences, can be tackled by solving a linear least-square problem, which can be done by finding the eigenvector corresponding to the smal ...

IEEE COMPUTER SOC2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Adam Teodor Polak

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Page 2 sur 2