Publications associées à Iterative deepening depth-first search

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

Full key recovery side-channel attack against ephemeral SIKE on the Cortex-M4

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

This paper describes the first practical single-trace side-channel power analysis of SIKE. While SIKE is a post-quantum key exchange, the scheme still relies on a secret elliptic curve scalar multiplication which involves a loop of a double-and-add procedu ...

2021

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

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

Nonbinary Associative Memory With Exponential Pattern Retrieval Capacity and Iterative Learning

Mohammad Amin Shokrollahi, Amir Hesam Salavati, Krishna Kumar

We consider the problem of neural association for a network of nonbinary neurons. Here, the task is to first memorize a set of patterns using a network of neurons whose states assume values from a finite number of integer levels. Later, the same network sh ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Sorting genomes with rearrangements and segmental duplications through trajectory graphs

Bernard Moret, Yu Lin, Mingfu Shao

We study the problem of sorting genomes under an evolutionary model that includes genomic rearrangements and segmental duplications. We propose an iterative algorithm to improve any initial evolutionary trajectory between two genomes in terms of parsimony. ...

Biomed Central Ltd2013

Message-Passing Algorithms for Quadratic Minimization

Nicholas Ruozzi

Gaussian belief propagation (GaBP) is an iterative algorithm for computing the mean (and variances) of a multivariate Gaussian distribution, or equivalently, the minimum of a multivariate positive definite quadratic function. Sufficient conditions, such as ...

Microtome Publishing2013

A comparison of global optimisation algorithms with standard benchmark functions and real-world applications using EnergyPlus

Jérôme Henri Kämpf, Darren Robinson

There is an increasing interest in the use of computer algorithms to identify combinations of parameters which optimise the energy performance of buildings. For such problems, the objective function can be multi-modal and needs to be approximated numerical ...

Taylor & Francis2010

Temporally Consistent Layer Depth Ordering Via Pixel Voting For Pseudo 3D Representation

Engin Türetken

A new region-based depth ordering algorithm is proposed based on the segmented motion layers with affine motion models. Starting from an initial set of layers that are independently extracted for each frame of an input sequence, relative depth order of eve ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

New dynamic programming algorithms for the resource constrained shortest path problem

Matteo Salani

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...

2008

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2007