Efficient and Stable Acoustic Tomography Using Sparse Reconstruction Methods

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

We study the glass transition by exploring a broad class of kinetic rules that can significantly modify the normal dynamics of supercooled liquids while maintaining thermal equilibrium. Beyond the usual dynamics of liquids, this class includes dynamics in ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

The remarkable ability of deep learning (DL) models to approximate high-dimensional functions from samples has sparked a revolution across numerous scientific and industrial domains that cannot be overemphasized. In sensitive applications, the good perform ...

We study the statistical mechanics and the equilibrium dynamics of a system of classical Heisenberg spins with frustrated interactions on a d -dimensional simple hypercubic lattice, in the limit of infinite dimensionality d -> infinity . In the analysis we ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn- Triantafillou [Math. Comp. 91 (2021), pp. 491 ...

We develop a very general version of the hyperbola method which extends the known method by Blomer and Brudern for products of projective spaces to complete smooth split toric varieties. We use it to count Campana points of bounded log-anticanonical height ...

The Super-X Divertor (SXD) is an alternative divertor configuration leveraging total flux expansion at the Outer Strike Point (OSP). While the extended 2-Point Model (2PM) predicts facilitated detachment access and control in the SXD configuration, these a ...

The present invention relates to a compound of the general formula (I), (II) and (III), more specifically of formula (Ia), (Ib), (Ic)wherein R11 and R12 or R21 and R22 or R31 and R32 are both hydrogen or form together with CHR50 a cyclic moiety or one of R ...

The goal of this work is to use anisotropic adaptive finite elements for the numerical simulation of aluminium electrolysis. The anisotropic adaptive criteria are based on a posteriori error estimates derived for simplified problems. First, we consider an ...

The optimal pricing of goods, especially when they are new and the innovating firm is a monopolist, must proceed without precise knowledge of the demand curve. This paper provides a pricing method with a relative robustness guarantee by maximizing a perfor ...

Computer simulations are often used as support material for science education, as they can engage students through inquiry-based learning, promote their active interaction in the experimentation phase, and help them visualize abstract concepts. For instanc ...

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

In this paper, we set the mathematical foundations of the Dynamical Low-Rank Approximation (DLRA) method for stochastic differential equations (SDEs). DLRA aims at approximating the solution as a linear combination of a small number of basis vectors with r ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

A kernel method for estimating a probability density function from an independent and identically distributed sample drawn from such density is presented. Our estimator is a linear combination of kernel functions, the coefficients of which are determined b ...

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Reduced-order models are indispensable for multi-query or real-time problems. However, there are still many challenges to constructing efficient ROMs for time-dependent parametrized problems. Using a linear reduced space is inefficient for time-dependent n ...

Efficient and Stable Acoustic Tomography Using Sparse Reconstruction Methods

Chat with Graph Search

Testing Theories of the Glass Transition with the Same Liquid but Many Kinetic Rules

A ride time-oriented scheduling algorithm for dial-a-ride problems

Towards Trustworthy Deep Learning for Image Reconstruction

Frustrated magnets in the limit of infinite dimensions: Dynamics and disorder-free glass transition

Learning to Remove Cuts in Integer Linear Programming

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Six-dimensional sphere packing and linear programming

HYPERBOLA METHOD ON TORIC VARIETIES

Parallel flows as a key component to interpret Super-X divertor experiments

Biobased surfactant

Adaptive Finite Elements with Large Aspect Ratio. Application to Aluminium Electrolysis

Monopoly Pricing with Unknown Demand

Teacher-Mediated and Student-Led Interaction with a Physics Simulation: Effects on the Learning Experience

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Dynamical Low-Rank Approximation for Stochastic Differential Equations

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Density estimation in RKHS with application to Korobov spaces in high dimensions

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Results on Sparse Integer Programming and Geometric Independent Sets

Non-intrusive data-driven reduced-order modeling for time-dependent parametrized problems