Concept

Probabilistic context-free grammar

Publications associées (49)

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 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

A probabilistic study of fatigue in post-weld treated tubular bridge structures

Scott Walbridge

In the design of tubular bridges, engineers have found the fatigue performance of the joints to be a critical aspect that may have a significant impact on the economic viability of these structures. In looking for ways of improving this performance, the us ...

EPFL2005

Modèles syntaxiques probabilistes non-génératifs

Antoine Rozenknop

This work deals with models used, or usable in the domain of Automatic Natural Language Processing, when one seeks a syntactic interpretation of a statement. This interpretation can be used as additional information for subsequent treatments, that can aim ...

EPFL2003

On Automatic Annotation of Images with Latent Space Models

Daniel Gatica-Perez, Florent Monay Michaud

Image auto-annotation, i.e., the association of words to whole images, has attracted considerable attention. In particular, unsupervised, probabilistic latent variable models of text and image features have shown encouraging results, but their performance ...

IDIAP2003

On Image Auto-Annotation with Latent Space Models

Daniel Gatica-Perez, Florent Monay Michaud

2003

Optimal Hebbian Learning: a Probabilistic Point of View

Wulfram Gerstner, Jean-Pascal Théodor Pfister

Many activity dependent learning rules have been proposed in order to model long-term potentiation (LTP). Our aim is to derive a spike time dependent learning rule from a probabilistic optimality criterion. Our approach allows us to obtain quantitative res ...

Istanbul, Turkey2003

An FPGA-based syntactic parser for large size real-life context-free grammars

Cristian Raul Ciressan

This thesis is at the crossroad between Natural Language Processing (NLP) and digital circuit design. It aims at delivering a custom hardware coprocessor for accelerating natural language parsing. The coprocessor has to parse real-life natural language and ...

EPFL2002

Probabilistic Queries in Large-Scale Networks

Fernando Pedone

Resource location is a fundamental problem for large-scale distributed applications. This paper discusses the problem from a probabilistic perspective. Contrary to deterministic approaches, which strive to produce a precise outcome, probabilistic approache ...

2002