Concept

Limite (mathématiques élémentaires)

Publications associées (106)

DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Securing ad hoc networks is notoriously challenging, notably due to the lack of an on-line infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case ...

2005

A simple model for NMR relaxation in the presence of internal motions with dynamical coupling

Geoffrey Bodenhausen, Daniel Abergel

In this paper some effects of dynamical coupling between two interaction-carrying vectors on the internal auto- and cross-correlation functions are investigated in the limit of small amplitude motions. A linearized Langevin approach allows the derivation o ...

2004

DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

2004

Non-linear subdivision using local spherical coordinates

Touradj Ebrahimi, Pierre Vandergheynst, Nicolas Aspert

In this paper, we present an original non-linear subdivision scheme suitable for univariate data, plane curves and discrete triangulated surfaces, while keeping the complexity acceptable. The proposed technique is compared to linear subdivision methods hav ...

2003

Non-linear subdivision of univariate signals and discrete surfaces

Nicolas Aspert

During the last 20 years, the joint expansion of computing power, computer graphics, networking capabilities and multiresolution analysis have stimulated several research domains, and developed the need for new types of data such as 3D models, i.e. discret ...

EPFL2003

On the Long-Run Behavior of Equation-Based Rate Control

Jean-Yves Le Boudec, Milan Vojnovic

We consider unicast equation-based rate con-trol, where, at some points in time, a sender adjusts its rate to f(p,r), where p is an on-line estimate of the loss-event rate observed by this source, r of the average round-trip time, and f is a TCP throughput ...

2003

Use of low voltage power networks for data transmission. EMC issues and standardization problems

Michel Ianoz

The use of the low voltage power network for data transmission can produce radiated disturbances. In order to determine field limits when using this technique and methods to check this limit, a procedure must be defined and a standard must be written. The ...

2002

Comparison of different chaos shift keying methods

Martin Hasler, Thomas Schimming

This paper examines a number of chaos shift keying methods Different approaches for the optimization of the transmitter and the receiver (based on statistical arguments) are compared through simulation. Based on the results, The tradeoff between computatio ...

2001

The universal limit in dynamics of dilute polymeric solutions

Michel Deville

The method of invariant manifold is developed for a derivation of reduced description in kinetic equations of dilute polymeric solutions. It is demonstrated that this reduced description becomes universal in the limit of small Deborah and Weissenberg numbe ...

2000

Dual limitations. Kinetic and stoichiometric analysis

Urs von Stockar

Although a rigorous definition of growth-limiting substrate relies on a kinetic anal., a simple stoichiometric anal. based on the calcn. of the conversion is more applicable. Anal. of single and dual limitations is based on a simulated example for a substr ...

1998

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