Concept

Espace complet

Publications associées (62)

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

Improved Phone Posterior Estimation Through k-NN and MLP-Based Similarity

Benjamin Picart

In this work, we investigate the possible use of k-nearest neighbour (kNN) classifiers to perform frame-based acoustic phonetic classification, hence replacing Gaussian Mixture Models (GMM) or MultiLayer Perceptrons (MLP) used in standard Hidden Markov Mod ...

Idiap2009

Hedlund metrics and the stable norm

Madeleine Jotz

The real homology of a compact Riemannian manifold M is naturally endowed with the stable norm. The stable norm on H-1 (M. R) arises from the Riemannian length functional by homogenization. It is difficult and interesting to decide which norms on the finit ...

Elsevier2009

A Stochastic Translation Algorithm: The View Of The Ribosome

Olivier Burri

This work deals with the creation of a stochastic translation algorithm capable of encompassing the reactions for translation initiation, elongation and termination in a unified framework based on Gillespie's algorithm. By looking at reactions from the poi ...

2009

Deducing Ink Thickness Variations by a Spectral Prediction Model

Roger Hersch, Thomas Bugnon, Mathieu Brichon, Peter Amrhyn, Safer Mourad, Frédérique Crété

Most existing techniques for regulating the ink flow in offset presses rely oil density measurements carried out oil specially printed patches. In the present contribution. we develop a methodology to deduce ink thickness variations from spectral measureme ...

Wiley-Blackwell2009

Mixed graph edge coloring

Bernard Ries

We are interested in coloring the edges of a mixed graph. i.e., a graph containing unoriented and oriented edges. This problem is related to a communication problem in job-shop scheduling systems. In this paper we give general bounds oil the number of requ ...

Elsevier2009

Steiner's Invariants and Minimal Connections

Marc Troyanov, Stephen Ducret

The aim of this note is to prove that any compact metric space can be made connected at a minimal cost, where the cost is taken to be the one-dimensional Hausdorff measure. ...

2008

Symmetry determination following structure solution in P1

A new method for space-group determination is described. It is based on a symmetry analysis of the structure-factor phases resulting from a structure solution in space group P1. The output of the symmetry analysis is a list of all symmetry operations compa ...

2008

Modeling and Numerical Simulation of a Complete Hydrolelectric Production Site

François Avellan, Jean-Jacques Simond

For many years the EPFL Laboratory for Electrical Machines develops SIMSEN, a numerical software package for the simulation in transient and steady-state conditions of electrical power systems and adjustable speed drives, having an arbitrary topology. SIMS ...

2007

MODELING AND NUMERICAL SIMULATION OF A COMPLETE HYDROELECTRIC PRODUCTION SITE

François Avellan, Jean-Jacques Simond, Christophe Nicolet, Philippe Allenbach

2007

Regularity in metric spaces

Serguei Timochine

Using arguments developed by De Giorgi in the 1950's, it is possible to prove the regularity of the solutions to a vast class of variational problems in the Euclidean space. The main goal of the present thesis is to extend these results to the more abstrac ...

EPFL2006