Concept

Noms des grands nombres

Publications associées (91)

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call mode ...

2010

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Nicolas Macris, Satish Babu Korada

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...

2010

Identity Aware Sensor Networks

Christina Fragouli, Suhas Diggavi, Lorenzo Keller, Mahdi Jafari Siavoshani

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit---for instance, in many cases, sensors are used to detec ...

2009

The age of gossip: Spatial mean-field regime

Jean-Yves Le Boudec, Nikodin Ristanovic

Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossiping, or epidemic algorithms. Similarly, in a network where mobile nodes occasio ...

2009

Cooperative Localization for Autonomous Underwater Vehicles

Alexander Bahr

This paper describes an algorithm for distributed acoustic navigation for Autonomous Underwater Vehicles (AUVs). Whereas typical AUV navigation systems utilize pre-calibrated arrays of static transponders, our work seeks to create a fully mobile network of ...

2009

Strong law of large numbers with concave moments

Nicolas Monod

In this note not intended for publication, it is observed that a wellnigh trivial application of the ergodic theorem of Karlsson–Ledrappier yields a strong LLN for arbitrary concave moments. ...

2008

Combinatorial synthesis of linearly condensed polycyclic compounds, including anthracyclinones, through tandem Diels-Alder additions

Pierre Vogel

Double exocyclic 1,3-dienes such as 2,3,5,6-tetramethylidene-7-oxabicyclo[2.2.1]heptane and its 1-substituted derivatives undergo two successive Diels-Alder additions with large reactivity difference between the addition of the first equivalent (k(1)) and ...

2008

Evaporation from three water bodies of diﬀerent sizes and climates: Measurements and scaling analysis

Shirit Cohen, Marc Parlange, Gabriel George Katul, Scott W. Tyler

Evaporation from small reservoirs, wetlands, and lakes continues to be a theoretical and practical problem in surface hydrology and micrometeorology because atmospheric ﬂows above such systems can rarely be approximated as stationary and planar-homogeneous ...

2008

An intelligent system for predicting HPDC process variables in interactive environment

Paul Xirouchakis, Jitender Kumar Rai

The selection of optimal parameters in high pressure die casting process (HPDC) has been long recognized as a complex nonlinear problem due to the involvement of a large number of interconnected process variables, each influencing the flow behavior of molt ...

Elsevier2008

Efficient evaluation of piecewise control laws defined over a large number of polyhedra

Colin Neil Jones

We consider the class of piecewise state feedback control laws applied to discrete-time systems, motivated by recent work on the computation of closed-form MPC controllers. The on-line evaluation of such a control law requires the determination of the stat ...

2007

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