Concept

Mesure de Jordan

Publications associées (30)

Discriminative Keyword Spotting

This paper proposes a new approach for keyword spotting, which is not based on HMMs. The proposed method employs a new discriminative learning procedure, in which the learning phase aims at maximizing the area under the ROC curve, as this quantity is the m ...

2007

Do Nash values have value?

Bettina Schaefli

How Do We Communicate Model Performance? The process of model performance evaluation is of primary importance, not only in the model development and calibration process, but also when communicating the results to other researchers and to stakeholders. The ...

Wiley-Blackwell2007

, , ,

We present a method that exploits an information theoretic framework to extract optimal audio features with respect to the video features. A simple measure of mutual information between the resulting audio features and the video ones allows to detect the a ...

IEEE2005

Computation of Observability Regions for Piecewise Affine Systems: A Projection-Based Algorithm

Giancarlo Ferrari Trecate

In this paper we consider the problem of computing sets of observable states for discrete-time, piecewise affine systems. When the maximal set of observable states is full-dimensional, we provide an algorithm for reconstructing it up to a zero measure set. ...

2005

Extraction of Audio Features Specific to Speech using Information Theory and Differential Evolution

Jean-Philippe Thiran, Jean-Marc Vesin, Murat Kunt, Vlad Popovici, Patricia Besson

We present a method that exploits an information theoretic framework to extract optimized audio features using the video information. A simple measure of mutual information (MI) between the resulting audio features and the video ones allows to detect the a ...

2005

Design and characterization of a CMOS 3-D image sensor based on single photon avalanche diodes

Edoardo Charbon, Pierre-André Besse, Cristiano Niclass, Alexis Rochas

The design and characterization of an imaging system is presented for depth information capture of arbitrary three-dimensional (3-D) objects. The core of the system is an array of 32 × 32 rangefinding pixels that independently measure the time-of-flight of ...

2005

The Complexity of Asynchronous Byzantine Consensus

Rachid Guerraoui, Marko Vukolic, Partha Dutta

This paper establishes the first theorem relating resilience, round complexity and authentication in distributed computing. We give an exact measure of the time complexity of consensus algorithms that tolerate Byzantine failures and arbitrary long periods ...

2004

Estimation of local aortic elastic properties with MRI

Nikolaos Stergiopoulos, Reto Meuli

Aortic compliance and pulse wave velocity (PWV) are important determiners of heart load, and are clinically useful indices of cardiovascular risk. Most direct methods to derive them require invasive pressure measurement. In this work a noninvasive techniqu ...

2002

Solving the $p$-Laplacian on manifolds

Marc Troyanov

We prove in this paper that the equation

\Delta _{p}u+h=0

on a

p

- hyperbolic manifold

M

has a solution with

p

-integrable gradient for any bounded measurable function

h : M \to \mathbb R

with compact support. ...

2000

Solving the p-Laplacian on manifolds

Marc Troyanov

We prove in this paper that the equation

Delta _{p}u+h=0

on a p-hyperbolic manifold M has a solution with p-integrable gradient for any bounded measurable function h : M -> R with compact support. ...

2000

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