Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a ...
In this paper we investigate the dam-break problem for viscoplastic (Herschel- Bulkley) fluids down a sloping flume: a fixed volume of fluid initially contained in a reservoir is released onto a slope and flows driven by gravitational forces until these fo ...
In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature address the consensus averaging problem by distributed linear iter ...
This thesis deals with the asymptotic analysis of coding systems based on sparse graph codes. The goal of this work is to analyze the decoder performance when transmitting over a general binary-input memoryless symmetric-output (BMS) channel. We consider t ...
Recent results have shown that interference alignment can achieve K/2 degrees of freedom in a K-user interference channel with time or frequency varying channel coefficients. For fixed number of users K, the number of degrees of freedom characterizes the a ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
Improvement over classical dynamic feedback linearization for a unicycle mobile robots is proposed. Compared to classical extension, the technique uses a higher-dimensional state extension, which allows rejecting a constant disturbance on the robot rotatio ...
We consider a model of the shape of a growing polymer introduced by Durrett and Rogers (Probab. Theory Related Fields 92 (1992) 337-349). We prove their conjecture about the asymptotic behavior of the underlying continuous process X-t (corresponding to the ...
In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature attack this problem by distributed linear iterative algorithms, wi ...
We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...
In the first part of this thesis we are interested in the asymptotic performance analysis of Non-Binary Low-Density Parity-Check (NBLDPC) codes over the Binary Erasure Channel (BEC) decoded via the suboptimal Belief Propagation (BP) decoder as well as the ...