Concept

Annatto

Publications associées (4)

Toward the sustainable cultivation of microalgae to produce renewable biofuels and fine chemicals

Microalgae are considered as renewable feedstock for the production of next-generation biofuels. However to achieve the financial sustainability to the algal biofuel production, it will be necessary to integrate it with the processing of high-value product ...

2014

Spectral Prediction of Juxtaposed Halftones Relying on the Two-by-two Dot Centering Model

Roger Hersch, Vahid Babaei

In a color reproduction workflow, spectral prediction models are useful for establishing the correspondence between colorant sur- face coverages and resulting printed halftone color. Spectral predic- tion models enable calculation of the color gamut and es ...

2013

Color images visible under UV light

Roger Hersch, Sylvain Chosson, Philipp Donzé

The present contribution aims at creating color images printed with fluorescent inks that are only visible under UV light. The considered fluorescent inks absorb light in the UV wavelength range and reemit part of it in the visible wavelength range. In con ...

2007

Coloring some classes of mixed graphs

Bernard Ries

We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs. A mixed coloring

c

is a coloring such that for every edge

[x_{i},x_{j}]

c(x_{i})\neq c(x_{j})

and for every arc

(x_{p},x_{q})

, $c(x_{p})

2007

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

Coloring some classes of mixed graphs

Bernard Ries

We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs. A mixed coloring

c

is a coloring such that for every edge

[x_{i},x_{j}]

c(x_{i})\neq c(x_{j})

and for every arc

(x_{p},x_{q})

, $c(x_{p})

2007