Concept

Levenshtein distance

Related publications (91)

A Gapless Post-quantum Hash Proof System in the Hamming Metric

A hash proof system (HPS) is a form of implicit proof of membership to a language. Out of the very few existing post-quantum HPS, most are based on languages of ciphertexts of code-based or lattice-based cryptosystems and inherently suffer from a gap cause ...

2023

Elastocapillary menisci mediate interaction of neighboring structures at the surface of a compliant solid

John Martin Kolinski

Surface stress drives long-range elastocapillary interactions at the surface of compliant solids, where it has been observed to mediate interparticle interactions and to alter the transport of liquid drops. We show that such an elastocapillary interaction ...

2023

Mapping Active Site Geometry to Activity in Immobilized Frustrated Lewis Pair Catalysts

Shubhajit Das, Rubén Laplaza Solanas, Jacob Terence Blaskovits

The immobilization of molecular catalysts imposes spatial constraints on their active site. We reveal that in bifunctional catalysis such constraints can also be utilized as an appealing handle to boost intrinsic activity through judicious control of the a ...

2022

A Kilometre-range Distributed Relative Humidity Fibre Sensor

Tiago Filipe Pimentel Das Neves

Fibre optics sensors have been identified as very good candidates for environmental monitoring inside the silicon detectors operated at CERN's Large Hadron Collider. The objective of this dissertation is the development of a Relative Humidity (RH) distribu ...

EPFL2022

Interpretable Social Anchors for Human Trajectory Forecasting in Crowds

Alexandre Massoud Alahi, Parth Ashit Kothari

Human trajectory forecasting in crowds, at its core, is a sequence prediction problem with specific challenges of capturing inter-sequence dependencies (social interactions) and consequently predicting socially-compliant multimodal distributions. In recent ...

2021

On the effectiveness of adversarial training against common corruptions

Nicolas Henri Bernard Flammarion, Maksym Andriushchenko, Klim Kireev

The literature on robustness towards common corruptions shows no consensus on whether adversarial training can improve the performance in this setting. First, we show that, when used with an appropriately selected perturbation radius, ℓp adversarial traini ...

2021

Regression Networks for Meta-Learning Few-Shot Classification

Matthias Grossglauser, Arnout Jan J Devos

We propose regression networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each class. In high dimensional embedding spaces the directi ...

2020

Graph Coarsening with Preserved Spectral Properties

Andreas Loukas

In graph coarsening, one aims to produce a coarse graph of reduced size while preserving important graph properties. However, as there is no consensus on which specific graph properties should be preserved by coarse graphs, measuring the differences betwee ...

ADDISON-WESLEY PUBL CO2020

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Rico Zenklusen, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

New Results On The Pseudoredundancy

Zihui Liu

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...

2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.