Concept

Camel case

Publications associées (117)

Data Reconciliation and Sampling Protocol Design: The Case of a Paper Deinking Proces

François Maréchal, Georges Heyen, David Brown

CONFIDENTIEL ...

2003

Combining Neural Gas and Learning Vector Quantization for Cursive Character Recognition

Alessandro Vinciarelli

This paper presents a cursive character recognizer, a crucial module in any Cursive Script Recognition system based on a segmentation and recognition approach. The character classification is achieved by combining the use of Neural Gas (NG) and Learning Ve ...

2003

Glass patterns in the superposition of random line gratings

Isaac Amidror

Moire effects ('Glass patterns') that occur in the superposition of correlated random layers have long been studied. However, only little is known of Glass patterns which occur in the 1D random case: namely, when the superposed layers consist of random lin ...

IOP Publishing2003

Biphasic constitutive laws for biological interface evolution

Dominique Pioletti, Lalaonirina Rakotomanana Ravelonarivo, Philippe Büchler

A model of tissue differentiation at the bone-implant interface is proposed. The basic hypothesis of the model is that the mechanical environment determines the tissue differentiation. The stimulus chosen is related to the bone-implant micromotions. Equati ...

2003

Managing Systemic Innovations in Rail Systems: The case of ERTMS technologies

Daniel Emery, Anne Curchod, Guillaume De Tilière

Interoperability has become a keyword in the European Transport Policy, with the strong objective to improve transportation services. In the rail sector, this trend is embodied in technological innovations: A deep change in the communication and signalling ...

2003

Face Class Modeling in Eigenfaces Space

Jean-Philippe Thiran, Vlad Popovici

We present a method for face class modeling in the eigenfaces space using a large-margin classifier like SVM. Another issue addressed is how to select the number of eigenfaces to achieve a good classification rate. As the experimental evidence show, genera ...

SPIE2003

On Probabilistic Network Calculus

Jean-Yves Le Boudec, Milan Vojnovic

Deterministic Network Calculus provides an elegant way to compute performance bounds, e.g. bounds on backlog, delay-jitter, loss ratio, and like. Such bounds are deterministic worst-case bounds. In some cases it is practically sensible that individual flow ...

2002

An Introduction to Low-Density Parity-Check Codes

Mohammad Amin Shokrollahi

In this paper we will survey some of the most recent results on low-density parity-check codes. Our emphasis will be primarily on the asymptotic theory of these codes. For the most part, we will introduce the main concepts for the easier case of the erasur ...

Springer2002

A one-dimensional model for blood flow: Application to vascular prosthesis

Alfio Quarteroni, Fabio Nobile, Luca Formaggia

We investigate a one-dimensional model of blood flow in human arteries. In particular, we consider the case when an abrupt variation of mechanical characteristic of artery is caused by the presence of a vascular prosthesis. The derivations of the model and ...

Springer2002

Hewlett-Packard: Creating a Virtual Supply Chain (B)

Ralf Seifert

This case is a short (2-page) follow-up to the A-case: IMD-6-0252 and should be used together with it. The case relates the story from July 2001 to July 2002, illustrating the complications encountered in finalizing the outsourcing agreement. It summarizes ...

2002

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