Publications related to Computability theory

Exploring High-Performance and Energy-Efficient Architectures for Edge AI-Enabled Applications

The desire and ability to place AI-enabled applications on the edge has grown significantly in recent years. However, the compute-, area-, and power-constrained nature of edge devices are stressed by the needs of the AI-enabled applications, due to a gener ...

EPFL2024

Surface Susceptibilities as Characteristic Models of Reflective Metasurfaces

Karim Achouri, Shourya Dutta Gupta, Ville Tuovi Tiukuvaara

While metasurfaces (MSs) are constructed from deeply subwavelength unit cells, they are generally electrically large and full-wave simulations of the complete structure are computationally expensive. Thus, to reduce this high computational cost, nonuniform ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

Accelerating materials discovery for solid state electrolytes

Matthieu Gilles Mottet

The development of new solid-state electrolytes is a key step in improving the performance and safety of battery technology. Although the use of first-principle methods has proved invaluable in better understanding the process at play in these materials, ...

EPFL2020

Parallel integro-differential equation solving via multi-channel reciprocal bianisotropic metasurface augmented by normal susceptibilities

Karim Achouri, Ali Momeni

Analog optical signal processing has dramatically transcended the speed and energy limitations accompanied with its digital microelectronic counterparts. Motivated by recent metasurface?s evolution, the angular scattering diversity of a reciprocal passive ...

2019

Penalization and Bayesian numerical methods for multiscale inverse problems

Andrea Di Blasio

In this thesis we consider inverse problems involving multiscale elliptic partial differential equations. The name multiscale indicates that these models are characterized by the presence of parameters which vary on different spatial scales (macroscopic, m ...

EPFL2019

Interactive Programming by Example

Mikaël Mayer

As of today, programming has never been so accessible. Yet, it remains a challenge for end-users: students, non-technical employees, experts in their domains outside of computer science, and so on. With its forecast potential for solving problems by only o ...

EPFL2017

Undecidability through Fourier series

In computability theory a variety of combinatorial systems are encountered (word problems, production systems) that exhibit undecidability properties. Here we seek such structures in the realm of Analysis, more specifically in the area of Fourier Analysis. ...

Elsevier Science Bv2016

Shapes from pixels

Martin Vetterli, Loïc Arnaud Baboulaz, Arash Amini, Mitra Fatemi

Continuous-domain visual signals are usually captured as discrete (digital) images. This operation is not invertible in general, in the sense that the continuous-domain signal cannot be exactly reconstructed based on the discrete image, unless it satisfies ...

Institute of Electrical and Electronics Engineers2016

Numerical Approximation of Flows in Random Porous Media

Francesco Tesei

The objective of this thesis is to develop efficient numerical schemes to successfully tackle problems arising from the study of groundwater flows in a porous saturated medium; we deal therefore with partial differential equations(PDE) having random coeffi ...

EPFL2016

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Mechanism of the Cassie-Wenzel transition via the atomistic and continuum string methods

Simone Meloni

The string method is a general and flexible strategy to compute the most probable transition path for an activated process (rare event). We apply here the atomistic string method in the density field to the Cassie-Wenzel transition, a central problem in th ...

Amer Inst Physics2015

A Multi Level Monte Carlo Method with Control Variate for elliptic PDEs with log-normal coefficients

Fabio Nobile, Francesco Tesei

We consider the numerical approximation of the stochastic Darcy problem with log-normal permeability field and propose a novel Multi Level Monte Carlo (MLMC) approach with a control variate variance reduction technique on each level. We model the log-perme ...

2015

Method and device for proving his identity

Serge Vaudenay, Ioana Cristina Carlson

The invention is related to a method allowing a prover holding a secret key (x) to prove its identity to a verifier and to prove to this verifier that he is within a predetermined distance of this verifier, said method comprising an initialization phase du ...

2015

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

Analysis of Descent-Based Image Registration

Pascal Frossard, Elif Vural

We present a performance analysis for image registration with gradient descent. We consider a typical multiscale registration setting where the global 2-D translation between a pair of images is estimated by smoothing the images and minimizing the distance ...

2013

A Distributed Algorithm for Computing the Node Search Number in Trees

Florian Huc

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50-79, 1994). It can be executed in an asynchronous environment, requires an overa ...

2012

Digital model-making and the encoding of design intent : notes on the computational synthesis of form

Nathaniel Zuelzke

Across many generations, including the digitally naïve and savvy, digital technologies introduce something other to the design process. This other quality ranges from inaccessibility to facile but opaque production of complexity, yet in all cases has obscu ...

EPFL2012

Framework for real-time traffic forecasting methodology under exogenous parameters

André-Gilles Dumont, Sofia Samoili

Ensuing from the deteriorating conditions of road networks, traffic forecasting techniques with mathematical and computer-theory methods have been employed to address the real-time prediction of traffic conditions and their dynamic control, with the optimu ...

2012

Extent-based incremental identification of reaction kinetics from spectroscopic data

Dominique Bonvin, Julien Léo Billeter, Sriniketh Srinivasan

Identification of kinetic models is an important step for the monitoring, control and optimization of chemical and pharmaceutical processes. Furthermore, the availability of a first-principles model often leads to substantial reduction in process developme ...

2012