Concept

Temps partagé

Publications associées (64)

Abolish Runtime Systems: Operating Systems Should Control the Execution

Singularity [1] is a research project in Microsoft Research that started with a question: what would a software platform look like if it was designed from scratch with the primary goal of dependability? Singularity is working to answer this question by bui ...

ACM2006

The Weakest Failure Detectors to Boost Obstruction-Freedom

Rachid Guerraoui, Michal Kapalka

This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even when universal objects (like compare-and-swap) or random oracles are availab ...

2006

The Weakest Failure Detectors to Boost Obstruction-Freedom

Rachid Guerraoui, Michal Kapalka

2006

PILOT: ProbabilistIc Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Providing reliable group communication is an ever recurring issue in distributed settings. In mobile ad hoc networks, this issue becomes more significant since all nodes act as peers, while the issue gets even more challenging due to highly dynamic and unp ...

2004

On Wide Band Broadcast Channels

Rüdiger Urbanke, Emre Telatar, Amos Lapidoth

We study the capacity regions of various broadband degraded broadcast channels including the degraded Poisson broadcast channel and the degraded very-noisy broadcast channel. It is shown that in the absence of dark current the capacity region of the degrad ...

2003

Modified fixed point algorithm in fluid–structure interaction

Fabio Nobile, Simone Deparis, Luca Formaggia

In this work, we address the numerical solution of some non-linear problems arising in the time discretization of fluid–structure interaction problems with fully implicit schemes. At each time step, we have to solve a highly non-linear coupled system, sinc ...

2003

PILOT: ProbabIlistic Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

2003

Achieving General Points in the 2-User Gaussian MAC Without Time-Sharing or Rate-Splitting by Means of Iterative Coding

Rüdiger Urbanke, Sanket Dusad, Abdelaziz Amraoui

We analyze iterative coding for the frame-synchronous binary-input discrete-time Gaussian multiple access channel. Using the method of Density Evolution, we optimize degree distributions to exhibit code ensembles whose iterative decoding thresholds are onl ...

2002

Two approaches for applet-based visible human slice extraction

Roger Hersch, Sebastian Gerlach

Real-time interactive slicing is a tool of choice for exploring 3D anatomic data sets such as the Visible Human. We offer real-time slicing on the Web by partitioning the application between a Java applet (the client) and the Web server. Two approaches for ...

SPIE-Int. Soc. Opt. Eng2001

Measurement campaign and numerical modelling in the complex topography of the Grenoble area (France) during summer '99

Hubert van den Bergh, Bertrand Calpini, Valentin Simeonov, Alain Clappier, Olivier Couach

Preliminary work confirmed the important contribution of regional scale processes on pollutant concns. obsd. at local scales. For Grenoble, France, the model domain for simulations discussed, was selected considering the topog., urban area distribution, bo ...

2001

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