Concept

Fonction de vraisemblance

Publications associées (366)

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

A Maximum-Likelihood Formalism for Sub-Resolution Axial Localization of Fluorescent Nanoparticles

Michaël Unser, Dimitri Nestor Alice Van De Ville, François Aguet

One of the ongoing challenges in single particle fluorescence microscopy resides in estimating the axial position of particles with sub-resolution precision. Due to the complexity of the diffraction patterns generated by such particles, the standard fittin ...

OSA2005

Capturing interactions in pedestrian walking behavior in a discrete choice framework

Michel Bierlaire, Gianluca Antonini

In this paper we propose a general framework for pedestrian walking behavior, based on discrete choice modeling. Two main behaviors are identified: emphunconstrained and emphconstrained. The constrained patterns are further classified into emphattractive i ...

2005

Building trust-aware P2P systems

Zoran Despotovic

This thesis is concerned with enabling e-commerce applications in decentralized environments, P2P networks in particular. The work goes along the following two dimensions: P2P reputation systems design and building P2P e-commerce services and applications. ...

EPFL2005

A Probabilistic Measure of Modality Reliability in Speaker Verification

Jonas Richiardi, Andrzej Drygajlo, Plamen Prodanov

In this paper, a probabilistic measure for reliability of speaker verification under noisy acoustic conditions is proposed. A Bayesian network is used to estimate a probability for verification errors, given the GMM-based speaker verification system output ...

IEEE2005

A Probabilistic Measure of Modality Reliability in Speaker Verification

2005

Joint Speech and Speaker Recognition

The goal of the present thesis was to investigate and optimize different approaches towards User-Customized Password Speaker Verification (UCP-SV) systems. In such systems, users can choose their own passwords, which will be subsequently used for verificat ...

IDIAP2005

Joint Speech and Speaker Recognition

École Polytechnique Fédérale de Lausanne, Computer Science Department2005

Joint speech and speaker recognition

The goal of the thesis is to investigate different approaches that combine and integrate Automatic Speech Recognition (ASR) and Speaker Recognition (SR) systems, with applications to (1) User-Customized Password Speaker Verification (UCP-SV) systems, and, ...

EPFL2005

Receiver design for multi-antenna wireless communications

Andreas Peter Burg

Algorithm choices and corresponding VLSI architectures for spatial multiplexing receivers in multiple-input multiple-output (MIMO) communication systems are described in this paper. Implementations of linear and successive interference cancellation receive ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2005

GA optimization of terminal antennas by the estimation of the population density of probability using dependency trees

Anja Skrivervik, Francisco Jesus Nunez

An application to antenna optimization of bayesian network density of probability estimators is presented. This technique is very usefull for optimizations where abig number of parameters, multiple solutions and local minima increase the likelihood to conv ...

2004