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.
The successful design of sensor network architectures depends crucially on the structure of the sampling, observation, and communication processes. One of the most fundamental ques- tions concerns the sufficiency of discrete approximations in time, space, and amplitude. In the case of space and time, the question can be rephrased as whether there is a spatio- temporal sampling theorem for typical data sets in sensor net- works. This question has a positive answer in many cases of interest. The issue of discretization of amplitudes is more subtle and can be expressed as the question of whether there is a (source/channel) separation theorem for typical sensor networks. We show that this question has a negative answer in general and that the price of separation can be large. To illustrate these issues, we review the underlying theory and discuss specific examples.
Pascal Fua, Zhen Wei, Edouard Robert Albert Patrick Dufour, Colin Pelletier
François Maréchal, Jonas Schnidrig, Arthur Antoine Chuat
Lenka Zdeborová, Emanuele Troiani, Giovanni Piccioli