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.
We study the fairness of TCP Vegas. The latter is an alternative to the commonly used TCP Reno, and uses measures of the round trip time as feedback on congestion. We consider two cases that depend on the value of the two parameters α and β co ...
We propose in this paper a new approach to three-dimensional digital lines (3DDLs) based on the study of the integer lattice generated by the projection of Z3 onto an euclidean plane which reduces the problem to dimension 2. The many properties of this lat ...
The current definition of 3D digital lines, which uses the 2D digital lines of closest integer points (Bresenham's lines) of two projections, has several drawbacks: the discrete topology of this 3D digital line notion is not clear; its third projection is, ...
Speaker verification is a biometric identity verification technique whose performance can be severely degraded by the presence of noise. Using a coherent notation, we reformulate and review several methods which have been proposed to quantify the uncertain ...
We propose here some basic approaches to direct processing of the 360o-images as we take into consideration the geometry of each one. Obviously, the geometry of each of these images is a consequence of the geometry of the sensor's mirror used. This tech ...
The paper establishes robustness, optimality, and convergence properties of the widely used class of instantaneous-gradient adaptive algorithms. The analysis is carried out in a purely deterministic framework and assumes no a priori statistical information ...
Every convex polyhedron in the Euclidean space Rd admits both H- and V-representation. For both formats, a representation is canonical if it is minimal and unique up to some elementary operations. In this paper, we extend the usual definition of canonic ...
Delaunay triangulations and their extensions to weighted sets of points are considered here in the Euclidean space as well as in the flat torus, an infinite space obtained by repeating periodically a finite square box. In order to avoid unsafe redundancies ...
The paper establishes several robustness, optimality, and convergence properties of the widely used class of instantaneous-gradient adaptive algorithms. The analysis is carried out in a purely deterministic framework and assumes no apriori statistical info ...
