Concept

Comparability

Publications associées (9)

Improved Ramsey-type results for comparability graphs

Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...

CAMBRIDGE UNIV PRESS2020

String graphs and incomparability graphs

János Pach

Given a collection C of curves in the plane, its string graph is defined as the graph with vertex set C, in which two curves in C are adjacent if and only if they intersect. Given a partially ordered set (P,

2012

High b-value diffusion-weighted imaging: a sensitive method to reveal white matter differences in schizophrenia

Jean-Philippe Thiran, Reto Meuli, Pierre Marquet, Patric Hagmann, Djalel Eddine Meskaldji, Leila Cammoun, Philipp Baumann

Over the last ten years, Diffusion-weighted Imaging (DWI) has become an important tool to investigate white matter (WM) anomalies in schizophrenia. Despite technological improvement and the exponential use of this technique, discrepancies remain and little ...

Elsevier2012

Driving a BCI Wheelchair: A Patient Case Study

José del Rocio Millán Ruiz, Robert Leeb, Tom Edward Carlson, Guillaume Monnard

Our brain-actuated wheelchair uses shared control to couple the user input with the contextual information about the surroundings in order to perform natural manoeuvres both safely and efficiently. In this study, we investigate the feasibility of using our ...

2012

Development of X-Ray Powder Diffraction Methods for Biomolecules

Sebastian Basso

The comparable order of magnitude between interatomic distances in a crystal and the wavelength of X-rays make X-ray crystallography the ideal analytical tool to gain insight into the structure of crystalline material, including biomolecules. Nevertheless, ...

EPFL2011

An automatic parameter extraction method for the 7x50m Stroke Efficiency Test

Jürg Markus Germann

We developed an automatic method to extract the parameters of the 7 x 50m Stroke Eficiency Test for swimming based on a wrist worn acceleration sensor device. In the wrist acceleration signal we detect characteristic swim events such as wall push-offs, wal ...

2008

Online Coloring of Comparability Graphs: some results

Benjamin Leroy-Beaulieu

We study online partitioning of posets from a graph theoretical point of view, which is coloring and cocoloring in comparability graphs. For the coloring problem, we analyse the First-Fit algorithm and show a ratio of

O(\sqrt{n})

; furthermore, we devise ...

2007

Compatibility modeling to support opportunity analysis in new product development

Julie Hohenegger

The general context of this Ph.D. dissertation is the new product development (NPD) which is the process for transforming an opportunity that is a business or technology gap in the current situation into a product available for sale. This Ph.D. dissertatio ...

EPFL2007

Risk assessment for arsenic in drinking water: Limits to achievable risk levels

Janet Gordon Hering

The drinking water standard or maximum contaminant level (MCL) for arsenic is currently being re-evaluated by the US Environmental Protection Agency. The health risk associated with exposure to arsenic through consumption of drinking water is a primary con ...

1996

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

Online Coloring of Comparability Graphs: some results

Benjamin Leroy-Beaulieu

O(\sqrt{n})

; furthermore, we devise ...

2007