Concept

Virgule flottante

Publications associées (243)

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

Snowflake Divertor Plasmas on TCV

Olivier Sauter, Basil Duval, Stefano Coda, Jean-Marc Moret, Ivo Furno, Federico Alberto Alfredo Felici, Richard Pitts, Antoine Pochelon, Costanza Zucca, Francesco Piras, Attila Bencze

Starting from a standard single null X-point configuration, a second order null divertor (snowflake (SF)) has been successfully created on the Tokamak à Configuration Variable (TCV) tokamak. The magnetic properties of this innovative configuration have bee ...

PPCF2008

Part II: Fibroblasts preferentially migrate in the direction of principal strain

Matthias Lütolf, Jeffrey Alan Hubbell

A growing body of evidence suggests that the sensory information from the cytoskeleton and integrins may be responsible for guiding migration during mechano- and haptotaxis. However, the dual function of these subcellular structures as mechano-sensors and ...

Springer-Verlag2008

Strategy Construction for Parity Games with Imperfect Information

Laurent Doyen

We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e. to determine the winning regions of players and corresponding winning strategi ...

2008

Method for automatic artifacts detection in human MR images

A method for detecting, in single time-point, in-vivo imaging data related to artifacts in the imaging of objects, includes acquiring at least one in-vivo image with imaging apparatus. A background image corresponds to imaged air of the in-vivo image. The ...

2008

Implementation of batch-based particle filters for multi-sensor tracking

Volkan Cevher

In this paper, we demonstrate fixed-point FPGA implementations of state space systems using Particle Filters, especially multi-target beating and range tracking systems. These trackers operate either as independent organic trackers or as a joint tracker to ...

2007

The generic Gröbner walk

The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An importa ...

2007

Miss Rate Prediction across Program Inputs and Cache Configurations

Chen Ding

Improving cache performance requires understanding cache behavior. However, measuring cache performance for one or two data input sets provides little insight into how cache behavior varies across all data input sets and all cache configurations. This pape ...

2007

Deflation in Krylov subspace methods and distance to uncontrollability

Daniel Kressner

The task of extracting from a Krylov decomposition the approximation to an eigenpair that yields the smallest backward error can be phrased as finding the smallest perturbation which makes an associated matrix pair uncontrollable. Exploiting this relations ...

2007

The medial axis of the union of inner Voronoi balls in the plane

Mark Pauly

Consider a dense sampling S of the smooth boundary of a planar shape O, i.e., an open subset of R-2. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particularly simple structure: it is the union of al ...

2007

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. Our work improves the previously best known (0. ...

Springer2007