Publications related to Edit distance

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

Rubén Laplaza Solanas, Anne-Clémence Corminboeuf, Shubhajit Das, 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 ...

Wiley-VCH Verlag GmbH2022

Analysis and Modeling of the Dynamics of Traction Forces during Cell Polarization and their Role in the Organization of Edge Activity

Zeno Messi

The capacity to break symmetry and organize activity to move directionally is a fundamental property of eukaryotic cells. To explain the organization of cell-edge activity, models commonly rely on front-to-back gradients of functional components or regulat ...

EPFL2021

Blind as a bat: spatial perception without sight

Frederike Dümbgen

Among our five senses, we rely mostly on audition and vision to perceive an environment. Our ears are able to detect stimuli from all directions, especially from obstructed and far-away objects. Even in smoke, harsh weather conditions, or at night â situ ...

EPFL2021

DeepFocus: a Few-shot Microscope Slide Auto-Focus using a Sample Invariant CNN-based Sharpness Function

Michael Stefan Daniel Liebling, Adrian Shajkofci

Autofocus (AF) methods are extensively used in biomicroscopy, for example to acquire timelapses, where the imaged objects tend to drift out of focus. AF algorithms determine an optimal distance by which to move the sample back into the focal plane. Current ...

2020

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

Jens Markus Zumbrägel, 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

Formal Analysis of Distance Bounding with Secure Hardware

Serge Vaudenay, Handan Kilinç Alper

A distance bounding (DB) protocol is a two-party authentication protocol between a prover and a verifier which is based on the distance between the prover and the verifier. It aims to defeat threats by malicious provers who try to convince that they are cl ...

2018

Implications of Position in Cryptography

Handan Kilinç Alper

In our daily lives, people or devices frequently need to learn their location for many reasons as some services depend on the absolute location or the proximity. The outcomes of positioning systems can have critical effects e.g., on military, emergency. Th ...

EPFL2018

Security of Distance-Bounding: A Survey

Serge Vaudenay, Gildas Avoine, Martin Benjamin, Ioana Cristina Carlson, Srdan Capkun, Aslan Tchamkerten

Distance-bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g. electronic payment or access control systems, whi ...

2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Rüdiger Urbanke, Seyed Hamed Hassani, Shrinivas Kudekar, Yury Polyanskiy

Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillic ...

IEEE2018

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study simultaneous localization and mapping with a device that uses reflections to measure its distance from walls. Such a device can be realized acoustically with a synchronized collocated source and receiver; it behaves like a bat with no capacity for ...

Ieee2017

Analysis of lightning-ionosphere interaction using simultaneous records of source current and 380 km distant electric field

Mario Paolone, Marcos Rubinstein, Mohammad Azadifar, Farhad Rachidi-Haeri, Wolfgang Schulz, Davide Pavanello, Dongshuai Li

We present simultaneous current and wideband electric field waveforms at 380 km associated with upward lightning flashes initiated from the Santis Tower, Switzerland. To the best of our knowledge, the dataset presented in this study includes the first simu ...

Elsevier2017

Distance Bounding based on PUF

Serge Vaudenay, Mathilde Igier

Distance Bounding (DB) is designed to mitigate relay attacks. This paper provides a complete study of the DB protocol of Kleber et al. based on Physical Unclonable Functions (PUFs). We contradict the claim that it resists to Terrorist Fraud (TF). We propos ...

Springer Int Publishing Ag2016

Cross-lingual Linking of Multi-word Entities and their corresponding Acronyms

Maud Ehrmann

This paper reports on an approach and experiments to automatically build a cross-lingual multi-word entity resource. Starting from a collection of millions of acronym/expansion pairs for 22 languages where expansion variants were grouped into monolingual c ...

European Language Resources Association (ELRA)2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

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

Do We Need Binary Features for 3D Reconstruction?

Pascal Fua, Xinchao Wang, Zhiye Wang, Bin Fan

Binary features have been incrementally popular in the past few years due to their low memory footprints and the efficient computation of Hamming distance between binary descriptors. They have been shown with promising results on some real time application ...

2016

Challenges in Distance Bounding

Serge Vaudenay

Smartcard-based protocols represent an increasingly large share of the wireless authentication market, from contactless payments to remote car unlocking. Unfortunately, relay attacks pose a significant threat to these wireless solutions. However, this risk ...

Ieee Computer Soc2015

Models and Algorithms for Comparative Genomics

Mingfu Shao

The deluge of sequenced whole-genome data has motivated the study of comparative genomics, which provides global views on genome evolution, and also offers practical solutions in deciphering the functional roles of components of genomes. A fundamental comp ...

EPFL2015

Budgeted sensor placement for source localization on trees

Patrick Thiran, Laura Elisa Celis, Brunella Marta Spinelli

We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...

2015