Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Concept

Levenshtein distance

Formal sciences
Theoretical computer science
Algorithms and data structures
Topics in algorithms and da...

About
Privacy
Disclaimer

Graph Chatbot

Related publications (26)

Page 2 of 2

Motion of an elastic capsule in a constricted microchannel

Lailai Zhu, Cecilia Rorai

We study the motion of an elastic capsule through a microchannel characterized by a localized constriction. We consider a capsule with a stress-free spherical shape and impose its steady-state configuration in an infinitely long straight channel as the ini ...

2015

Novel GCC-PHAT Model in Diffuse Sound Field for Microphone Array Pairwise Distance Based Calibration

Hervé Bourlard, Afsaneh Asaei, Mohammadjavad Taghizadeh

We propose a novel formulation of the generalized cross correlation with phase transform (GCC-PHAT) for a pair of microphones in diffuse sound field. This formulation elucidates the links between the microphone distances and the GCC-PHAT output. Hence, it ...

2015

Discriminative Learning of Deep Convolutional Feature Point Descriptors

Pascal Fua, Eduard Trulls Fortuny

Deep learning has revolutionalized image-level tasks such as classification, but patch-level tasks, such as correspondence, still rely on hand-crafted features, e.g. SIFT. In this paper we use Convolutional Neural Networks (CNNs) to learn discriminant patc ...

2015

An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes

Bernard Moret, Yu Lin, Mingfu Shao

Computing the edit distance between two genomes is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. The edit distance under t ...

Mary Ann Liebert2015

Location leakage in distance bounding: Why location privacy does not work

Serge Vaudenay, Aikaterini Mitrokotsa

In many cases, we can only have access to a service by proving we are sufficiently close to a particular location (e.g. in automobile or building access control). In these cases, proximity can be guaranteed through signal attenuation. However, by using add ...

Elsevier2014

Right-Protected Data Publishing with Provable Distance-Based Mining

Michail Vlachos, Nikolaos Freris

Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...

Ieee Computer Soc2014