Publication

Improved hardness results for unique shortest vector problem

Publications associées (31)

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2023

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Frédéric Vogel, Oliver Kröcher, David Baudouin, Ayush Agarwal

Ru/CNF catalysts of different Ru nanoparticle (NP) sizes (0.9-2.7 nm) were assessed for their performance in continuous supercritical water gasification (SCWG) of glycerol. A structure sensitivity of Ru was demonstrated, with high initial turnover frequenc ...

2022

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Seth Gilbert, Vincent Gramoli, Jovan Komatovic, Pierre Philippe Civit

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

IEEE2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Data-driven and Safe Networked Control with Applications to Microgrids

Mustafa Sahin Turan

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

EPFL2022

fGOT: Graph Distances Based on Filters and Optimal Transport

Pascal Frossard, Giovanni Chierchia, Hermina Petric Maretic, Mireille El Gheche

Graph comparison deals with identifying similarities and dissimilarities between graphs. A major obstacle is the unknown alignment of graphs, as well as the lack of accurate and inexpensive comparison metrics. In this work we introduce the filter graph dis ...

ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2022

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Mahmoud S. M. Shaqfa

As historical stone masonry structures are vulnerable and prone to damage in earthquakes, investigating their structural integrity is important to reduce injuries and casualties while preserving their historical value. Stone masonry is a composite material ...

EPFL2022

Data-based model maintenance in the era of industry 4.0: A methodology

Dimitrios Kyritsis, Antoine Pélissier, Foivos Psarommatis Giannakopoulos

Despite the high number of investments for data-based models in the expansion of Industry 4.0, too little effort has been made to ensure the maintenance of those models. In a data-streaming environment, data-based models are subject to concept drifts. A co ...

ELSEVIER SCI LTD2022

Mediating Computational Thinking Through Educational Robotics In Primary School

Morgane Solène Denise Chevalier

Nowadays, computational thinking (CT) is considered a skill to be taught. While educational robotics (ER) appears promising to foster students' CT, operational CT frameworks and explicit guidance in ER are lacking. This thesis thus proposes to understand h ...

EPFL2022

TimeEvolver: A program for time evolution with improved error bound

Sebastian Zell

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

ELSEVIER2022