Concept

Ensemble partiellement ordonné

Publications associées (80)

SPBC: Leveraging the Characteristics of MPI HPC Applications for Scalable Checkpointing

The high failure rate expected for future supercomputers requires the design of new fault tolerant solutions. Most checkpointing protocols are designed to work with any message-passing application but suffer from scalability issues at extreme scale. We tak ...

2013

Species-specific detection of the antiviral small-molecule compound CMA by STING

Andrea Ablasser

Extensive research on antiviral small molecules starting in the early 1970s has led to the identification of 10-carboxymethyl-9-acridanone (CMA) as a potent type I interferon (IFN) inducer. Up to date, the mode of action of this antiviral molecule has rema ...

2013

Extensions of a result of Elekes and Rónyai

Frank de Zeeuw

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and Rónyai proved that if the graph of a polynomial f(x, y) contains cn2 points of an n × n × n cartesia ...

Elsevier2013

Global dynamics away from the ground state for the energy-critical nonlinear wave equation

Joachim Krieger

We study global behavior of radial solutions for the nonlinear wave equation with the focusing energy critical nonlinearity in three and five space dimensions. Assuming that the solution has energy at most slightly more than the ground states and gets away ...

2013

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

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

Competition between two- and three-sublattice ordering for S=1 spins on the square lattice

Frédéric Mila, Karlo Penc, Tamás András Tóth

We provide strong evidence that the S = 1 bilinear-biquadratic Heisenberg model with nearest-neighbor interactions on the square lattice possesses an extended three-sublattice phase induced by quantum fluctuations for sufficiently large biquadratic interac ...

2012

Three-sublattice order in the SU(3) Heisenberg model on the square and triangular lattice

Frédéric Mila, Karlo Penc

We present a numerical study of the SU(3) Heisenberg model of three-flavor fermions on the triangular and square lattice by means of the density-matrix renormalization group and infinite projected entangled-pair states. For the triangular lattice we confir ...

2012

Predicting The Ultimate Supremum Of A Stable Levy Process With No Negative Jumps

Robert Dalang, Violetta Bernyk

Given a stable Levy process X = (X-t)(0

2011

Adjacent Crossings Do Matter

Radoslav Fulek

In a drawing of a graph, two edges form an odd pair if they cross each other an odd number of times. A pair of edges is independent if they share no endpoint. For a graph G, let ocr(G) be the smallest number of odd pairs in a drawing of G and let iocr(G) b ...

Springer-Verlag Berlin2011

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