Concept

IEEE 754

Publications associées (58)

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

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

Dynamic Texture on Fixed-Point Architectures

Sabine Süsstrunk, Luciano Sbaiz, Roberto Costantini

Dynamic textures are sequences of images showing temporal regularity; they can be found in videos representing smoke, flames, flowing water, or moving grass, for instance. Recently, one method based on linear dynamic system theory was proposed to synthesiz ...

2006

A Snake-Based Approach to Accurate Determination of Both Contact Points and Contact Angles

Patrik Willi Hoffmann, Daniel Sage, Laura Barbieri, Gerit Kulik

We present a new method based on B-spline snakes (active contours) for measuring high-accuracy contact angles. In this approach, we avoid making physical assumptions by defining the contour of the drop as a versatile B-spline curve. When useful, we extend ...

Elsevier2006

Achievable error exponents in multiterminal source coding

Michael Christoph Gastpar

Encoding correlated sources at separate encoders has been studied extensively from the perspective of asymptotically long block codes. The associated error exponents are known for the case of lossless source coding. In this paper, we introduce a novel tech ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

On the use of training sequences for channel estimation

Emre Telatar, Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. We study a scenario where communication is carried by first testing the channel by means of a training ...

2006

Feedback communication over unknown channels

Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev erro ...

EPFL2005

Methods for Stator Flux Estimation in Sensorless Field Orientation Control of Induction Motor

Drazen Dujic

Developments trends in commercial drives point that that the next generation of them includes some sort of sensorless torque control. Using the 'spare' processing power of a digital signal processor (DSP) to implement these techniques can significantly red ...

IEEE2005

On the use of training sequences for channel estimation

Emre Telatar, Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q is available with perfect (causal) feedback for communication. A recent result (A. Tchamkerten and I.E. Telatar) shows the existence, for certain families of channels (e.g. binar ...

2005

Compact Q-Learning Optimized for Micro-robots with Processing and Memory Constraints

Roland Siegwart, Masoud Asadpour

Scaling down robots to miniature size introduces many new challenges including memory and program size limitations, low processor performance and low power autonomy. In this paper we describe the concept and implementation of learning of a safewandering ta ...

2004

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