Concept

Mesure de similarité

Publications associées (63)

The complexity of error metrics

Approximate computing exploits the fact that many applications do not require the results to be exact but not to exceed a threshold in a given error metric. Algorithms in approximate computing require to compute the error of the approximation in order to m ...

ELSEVIER SCIENCE BV2018

Capturing the Moment: Lightweight Similarity Computations

Rachid Guerraoui, Rhicheek Patra, Georgios Damaskinos

Similarity computations are crucial in various web activities like advertisements, search or trust-distrust predictions. These similarities often vary with time as product perception and popularity constantly change with users' evolving inclination. The hu ...

IEEE2017

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

INFORMATION THEORETIC CLUSTERING FOR UNSUPERVISED DOMAIN-ADAPTATION

Petr Motlicek, Subhadeep Dey

The aim of the domain-adaptation task for speaker verification is to exploit unlabelled target domain data by using the labelled source domain data effectively. The i-vector based Probabilistic Linear Dis- criminant Analysis (PLDA) framework approaches thi ...

IEEE2016

INFORMATION THEORETIC CLUSTERING FOR UNSUPERVISED DOMAIN-ADAPTATION

Petr Motlicek, Subhadeep Dey

Idiap2016

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

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

Adaptive relevance feedback for large-scale image retrieval

François Fleuret, Nicolae Suditu

Content-based image retrieval aims at substituting traditional indexing based on manual annotation by using automatically-extracted visual indexing features. Novel techniques are needed however to efficiently deal with the semantic gap (i.e. the partial ma ...

2016

Minimal entropy for uniform lattices in product of hyperbolic planes

Louis Georges Eric Merlin

Let M be a quotient of H-2 x ... x H-2 (product of hyperbolic planes) by a uniform lattice of. PSL2(R))(n). We prove that, among metrics of M of prescribed volume, the sum of hyperbolic metrics has minimal volume entropy. ...

European Mathematical Soc2016

Evaluation of control strategies for fixed-wing drones following slow-moving ground agents

Dario Floreano, Jean-Christophe Zufferey, Grégoire Hilaire Marie Heitz, Maja Varga

There are many situations where fixed-wing drones may be required to track ground moving agents, such as humans or cars, which are typically slower than drones. Some control strategies have been proposed and validated in simulations using the average dista ...

Elsevier2015

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search