Publications associées à Function computation over linear channels

Publications associées (29)

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

Gait Phase Estimation in Steady Walking: A Comparative Study of Methods Based on the Phase Portrait of the Hip Angle

Auke Ijspeert, Mohamed Bouri, Ali Reza Manzoori

Accurate real-time estimation of the gait phase (GP) is crucial for many control methods in exoskeletons and prostheses. A class of approaches to GP estimation construct the phase portrait of a segment or joint angle, and use the normalized polar angle of ...

IEEE Xplore2023

On Succinct Non-interactive Arguments in Relativized Worlds

Alessandro Chiesa

Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

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

Theory for the density of interacting quasilocalized modes in amorphous solids

Matthieu Wyart, Thomas Willem Jan de Geus, Marko Popovic, Wencheng Ji

Quasilocalized modes appear in the vibrational spectrum of amorphous solids at low frequency. Though never formalized, these modes are believed to have a close relationship with other important local excitations, including shear transformations and two-lev ...

AMER PHYSICAL SOC2019

Cryptanalysis of Enhanced MORE

Serge Vaudenay, Damian Vizár

Fully homomorphic encryption (FHE) has been among the most popular research topics of the last decade. While the bootstrapping-based, public key cryptosystems that follow Gentry's original design are getting more and more efficient, their performance is st ...

2018

When Stuck, Flip a Coin : New Algorithms for Large-Scale Tasks

Slobodan Mitrovic

Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question: How can we design efficient algorithms for large-scale computation? In this thesis, we focus on devising a general strategy to addr ...

EPFL2018

Fast hierarchical solvers for symmetric eigenvalue problems

Ana Susnjara

In this thesis we address the computation of a spectral decomposition for symmetric banded matrices. In light of dealing with large-scale matrices, where classical dense linear algebra routines are not applicable, it is essential to design alternative tech ...

EPFL2018

Shape Projectors for Landmark-Based Spline Curves

Michaël Unser, Daniel Andreas Schmitter

We present a generic method to construct orthogonal projectors for two-dimensional landmark-based parametric spline curves. We construct vector spaces that define a geometric transformation (e.g., affine, similarity, and scaling) that is applied to a refer ...

IEEE Institute of Electrical and Electronics Engineers2017

Generalization of the Concept of Extents to Distributed Reaction Systems

Dominique Bonvin, Julien Léo Billeter, Diogo Filipe Mateus Rodrigues

In the chemical industry, a large class of processes involving reactions can be described by partial differential equations that depend on time and on one or more spatial coordinates. Examples of such distributed reaction systems are tubular reactors and r ...

Elsevier2017

Concept and Applications of Extents in Chemical Reaction Systems

Dominique Bonvin, Michael Amrhein, Julien Léo Billeter, Sriniketh Srinivasan, Diogo Filipe Mateus Rodrigues

Models of chemical reaction systems can be quite complex as they typically include information regarding the reactions, the various transfers of heat and mass, as well as the effects of the inlet and outlet flows. It is well known that a linear transformat ...

2017

Towards Generalized FRI Sampling with an Application to Source Resolution in Radioastronomy

Martin Vetterli, Thierry Blu, Hanjie Pan

It is a classic problem to estimate continuous-time sparse signals, like point sources in a direction-of-arrival problem, or pulses in a time-of-flight measurement. The earliest occurrence is the estimation of sinusoids in time series using Prony's method. ...

Institute of Electrical and Electronics Engineers2017

Enumeration of reversible functions and its application to circuit complexity

Giovanni De Micheli, Mathias Soeken

We review combinational results to enumerate and classify reversible functions and investigate the application to circuit complexity. In particularly, we consider the effect of negating and permuting input and output variables and the effect of applying li ...

Springer2016

Local Geometric Transformations in Image Analysis

Zsuzsanna Püspöki

The characterization of images by geometric features facilitates the precise analysis of the structures found in biological micrographs such as cells, proteins, or tissues. In this thesis, we study image representations that are adapted to local geometric ...

EPFL2016

Representer Theorems for Sparsity-Promoting $ ℓ _{ 1 } $ Regularization

Michaël Unser, Julien René Fageot, Harshit Gupta

We present a theoretical analysis and comparison of the effect of

ℓ _{ 1 }

versus

ℓ _{ 2 }

regularization for the resolution of ill-posed linear inverse and/or compressed sensing problems. Our formulation covers the most general setting where the s ...

IEEE2016

Function Computation over Networks : Efficient Information Processing for Cache and Sensor Applications

Chien-Yi Wang

This thesis looks at efficient information processing for two network applications: content delivery with caching and collecting summary statistics in wireless sensor networks. Both applications are studied under the same paradigm: function computation ove ...

EPFL2015

Structure Tensor Total Variation

Michaël Unser, Stamatios Lefkimmiatis

We introduce a novel generic energy functional that we employ to solve inverse imaging problems within a variational framework. The proposed regularization family, termed as structure tensor total variation (STV), penalizes the eigenvalues of the structure ...

SIAM2015

Data Reconciliation in Open Reaction Systems using the Concept of Extents

Dominique Bonvin, Julien Léo Billeter, Sriniketh Srinivasan

Kinetic models of chemical reaction systems are typically represented in terms of state variables, such as concentrations, temperature and partial pressures [1]. These state variables in turn depend on the underlying reactions, transfer phenomena, and tran ...

2015