Concept

Iterative deepening depth-first search

Publications associées (34)

A local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations

We introduce a local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations. The proposed method is based on a coarse grid and iteratively improves the solution's accuracy by solving local elliptic problems in refined subdomains ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Horizontal side-channel full key recovery on ephemeral SIKE

Natacha Yolande Emmanuel Marie Linard de Guertechin, Aymeric Genet, Novak Kaluderovic

This paper describes the first practical single-trace side-channel power analysis of SIKE. The attack exploits the nature of elliptic curve point addition formulas which require the same function to be executed multiple times. We target the three point lad ...

2021

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

Auke Ijspeert, Mehmet Hasan Mutlu, Simon Lukas Hauser, Hala Khodr, Alexandre Bernardino

Self-reconfiguration is a hard problem due to the high dimensionality of self-reconfigurable modular systems. Searchbased approaches offer complete and optimal solutions. However, naive search algorithms cannot directly solve self-reconfiguration tasks in ...

2019

Optimal Lagrange Multipliers for Dependent Rate Allocation in Video Coding

Pascal Frossard, Ana Karina De Abreu Goes

In a typical video rate allocation problem, the objective is to optimally distribute a source rate budget among a set of (in)dependently coded data units to minimize the total distortion. Conventional Lagrangian approaches convert the lone rate constraint ...

Elsevier2018

Challenges and opportunities of interdisciplinarity : insights from human-centric building research at EPFL

Marilyne Andersen

Interdisciplinarity has become an inherent component of most research and education developments nowadays. It brings with it new challenges, from how to share a common language to how to avoid becoming generalists, as well as new opportunities in solving m ...

2017

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Interbands Phase Models for Polychromatic Image Reconstruction in Optical Interferometry

Alessio Ferrari, Ferréol Arnaud Marie Soulez

This paper presents an extension of the spatio-spectral ("3D") image reconstruction algorithm called PAINTER (Polychromatic opticAl INTErferometric Reconstruction software). The algorithm is able to solve large scale problems and relies on an iterative pro ...

SPIE2016

Distributed Modifier-Adaptation Schemes for the Real-Time Optimization of Interconnected Systems in the Presence of Structural Plant-Model Mismatch

Dominique Bonvin, René Uwe Schneider, Predrag Milosavljevic

The desire to operate chemical processes in a safe and economically optimal way has motivated the development of so-called real-time optimization (RTO) methods [1]. For continuous processes, these methods aim to compute safe and optimal steady-state set ...

2016

Digital Phase Reconstruction via Iterative Solutions of Transport-of-Intensity Equation

Michaël Unser, Emrah Bostan, Stamatios Lefkimmiatis, Emmanuel Augustin Julien Froustey

We develop a variational algorithm for reconstructing phase objects from a series of bright field micrographs. Our mathematical model is based on the transport-of-intensity equation (TIE), which links the phase of a complex field to the axial derivative of ...

Ieee2014

Digital Phase Reconstruction via Iterative Solutions of Transport-of-Intensity Equation

Michaël Unser, Emrah Bostan, Stamatios Lefkimmiatis, Emmanuel Augustin Julien Froustey

IEEE2014

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

SIAM2016