Additive Combinatorics and Discrete Logarithm Based Range Protocols
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.
For the analysis of flows in compliant vessels, we propose an approach to couple the original 3D equations with a convenient 1D model. This multi-scale strategy allows for a dramatic reduction of the computational complexity and is suitable for "absorbing" ...
In this paper we address the problem of multi-object tracking in video sequences, with application to pedestrian tracking in a crowd. In this con- text, particle ¯lters provide a robust tracking framework under ambiguity conditions. The particle ¯lter tech ...
Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...
Signal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames constructed from graphs, like wavelets on graphs, has substantially increased. To attain scalabili ...
Institute of Electrical and Electronics Engineers0
Deterministic Network Calculus provides an elegant way to compute performance bounds, e.g. bounds on backlog, delay-jitter, loss ratio, and like. Such bounds are deterministic worst-case bounds. In some cases it is practically sensible that individual flow ...
In this paper we derive a computationally efficient algorithm for accurately approximatinga long FIR filter by a reduced-parameter pole-zero filter. Our derivation successfully extends the "embedding" approach of [1,2] to the case of an unequal number of p ...
