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 spatialization of the sound field in a room, in particular the evolution of room impulse responses as function of their spatial positions. The presented technique allows us to completely characterize the sound field in any arbitrary location i ...
The increasing complexity of nowadays applications has lead to the need of more and more intensive specification and validation tasks by means of software implementations. Besides, as the complexity grows, it is becoming very hard to understand the specifi ...
This chapter presents a survey of interpolation and resampling techniques in the context of exact, separable interpolation of regularly sampled data. In this context, the traditional view of interpolation is to represent an arbitrary continuous function as ...
This paper proposes a novel generic scheme enabling the combination of multiple inclusion representations to propagate numerical constraints. The scheme allows bringing into the constraint propagation framework the strength of inclusion techniques coming f ...
Swiss Federal Institute of Technology in Lausanne (EPFL)2004
The E-star algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of an underlying smooth goal distance that takes into account a continuous notion ...
This article presents optimization results on the MOVA undeniable signature scheme presented last year by Monnerat and Vaudenay at PKC'04 as well as its generalization proposed at Asiacrypt'04 which is based on a secret group homomorphism. The original MOV ...
A number of signature schemes and standards have been recently designed, based on the discrete logarithm problem. Examples of standards are the DSA and the KCDSA. Very few formal design/security validations have already been conducted for both the KCDSA an ...
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algo ...
This article describes a method of constructing parametric models out of captured motion and skeleton data. Casting the problem as scattered data interpolation, our work is based on a multi-step approximation for the interpolation function with motion data ...
We propose a novel detection method for non-coherent synchronization (signal acquisition) in multi-access UWB impulse radio (IR) networks. It is designed to solve the IUI (Inter-User Interference) that occurs in some ad-hoc networks where concurrent transm ...
