Publications related to Levenshtein distance

Photon detecting 3d imaging sensor device

Edoardo Charbon, Preethi Padmanabhan, Augusto Ronchini Ximenes

The invention relates to a photon detecting 3D imaging sensor device for detecting a distance information for pixels in an image, comprising: - an array of detector units, wherein each detector unit is configured to receive a light signal pulse and to prov ...

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

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

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Jian Li, Lingxiao Huang

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...

IEEE COMPUTER SOC2018

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

From Tarski's Plank Problem to Simultaneous Approximation

János Pach, Andrei Kupavskii

A slab (or plank) is the part of the d-dimensional Euclidean space that lies between two parallel hyperplanes. The distance between the these hyperplanes is called the width of the slab. It is conjectured that the members of any infinite family of slabs wi ...

Mathematical Assoc Amer2017

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

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

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.

Levenshtein distance

Enhancing general spatial skills of young visually impaired people with a programmable distance discrimination training: a case control study

Photon detecting 3d imaging sensor device

Formal Analysis of Distance Bounding with Secure Hardware

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

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

End-to-end text-dependent speaker verification using novel distance measures

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

From Tarski's Plank Problem to Simultaneous Approximation

Distance Bounding based on PUF

Approximation algorithms for geometric dispersion

Graph Chatbot

Chat with Graph Search

From Tarski's Plank Problem to Simultaneous Approximation

Formal Analysis of Distance Bounding with Secure Hardware

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

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

End-to-end text-dependent speaker verification using novel distance measures

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

Approximation algorithms for geometric dispersion

Distance Bounding based on PUF

Photon detecting 3d imaging sensor device

Enhancing general spatial skills of young visually impaired people with a programmable distance discrimination training: a case control study