Concept

Analyse en composantes indépendantes

Publications associées (302)

Efficient Matchmaking and Directory Services

It has been widely recognised that matchmaking is an important component of heterogeneous multiagent systems. Several researchers have developed powerful techniques for the matchmaking problem in general. There are also specific representation of agent cap ...

Swiss Federal Institute of Technology (EPFL)2002

PCA in Autocorrelation Space

Jean-Philippe Thiran, Vlad Popovici

The use of higher order autocorrelations as features for pattern classification has been usually restricted to second or third orders due to high computational costs. Since the autocorrelation space is a high dimensional space we are interested in reducing ...

SPIE2002

Wavelet de-noising for highly noisy source separation

Kamiar Aminian, Philippe Robert, Anisoara Ionescu, Bijan Najafi

The aim of this paper is to demonstrate that wavelet denoising processing is extremely attractive for efficient source separation of strong noisy mixtures. Systematic numerical simulations using source separation algorithms after wavelet de-noising are use ...

2002

Networks on Chips: A New SoC Paradigm

Giovanni De Micheli, Luca Benini

A system on chip (SoC) can provide an integrated solution to challenging design problems in the telecommunications, multimedia, and consumer electronics domains. Much of the progress in these fields hinges on the designers' ability to conceive complex elec ...

Institute of Electrical and Electronics Engineers2002

Intensifying the relationship between e-learning postgraduate students

Philippe Thalmann, Sandra Rihs

The postgraduate course for construction management and economics at the Swiss Federal Institute of Technology in Lausanne is an e-learning course for architects and civil engineers. The students are mostly fulltime employees, who put a strong emphasis on ...

2002

Flexibler Subtyping Relations for Component-Oriented Formalisms

In the first part of this paper we present a new general component-oriented formalism, which has, among others, the following features: Concurrency, atomicity, synchronization between and inside components, and modularity. We give the inference rules which ...

2002

Flexible Subtyping Relations for Component-Oriented Formalisms

2002

Investigation of the carbon monoxide and oxy hemoglobin I complexes from Lucina pectinata by femtosecond transient absorption

Majed Chergui

Hb I (HbI) is an invertebrate monomeric hemeprotein from Lucina pectinata that contains 142 amino acid residues. The HbI heme pocket structural compn. shows an arrangement of phenylalanyl residues (Phe (29), Phe (43) and Phe (68)) that has not been obsd. i ...

2002

Offline Cursive Word Recognition using Continuous Density Hidden Markov Models trained with PCA or ICA Features

Samy Bengio, Alessandro Vinciarelli

This work presents an Offline Cursive Word Recognition System dealing with single writer samples. The system is a continuous density hiddden Markov model trained using either the raw data, or data transformed using Principal Component Analysis or Independe ...

IDIAP2001

Measurement campaign and numerical modelling in the complex topography of the Grenoble area (France) during summer '99

Hubert van den Bergh, Bertrand Calpini, Valentin Simeonov, Alain Clappier, Olivier Couach

Preliminary work confirmed the important contribution of regional scale processes on pollutant concns. obsd. at local scales. For Grenoble, France, the model domain for simulations discussed, was selected considering the topog., urban area distribution, bo ...

2001

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