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.
Abstract—Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea ...
Institute of Electrical and Electronics Engineers2011
This paper introduces a new concept of modular flexure-based mechanisms to design industrial ultra-high precision robots, which aims at significantly reducing both the complexity of their design and their development time. This modular concept can be consi ...
This paper introduces a new concept of modular flexure-based mechanisms to design industrial ultra-high precision robots, which aims at significantly reducing both the complexity of their design and their development time. This modular concept can be consi ...
We present a contribution to the structure theory of locally compact groups. The emphasis is put on compactly generated locally compact groups which admit no infinite discrete quotient. It is shown that such a group possesses a characteristic cocompact sub ...
In the context of coupling methods that match molecular dynamics with finite elements, we focus on the finite temperature and heat rates treatment done by Bridging Domain approaches. The energy dissipation occurring due to the projection of the fine scale ...
This paper presents a Lagrangian approach for the simulation of two-dimensional free-surface flows along with a systematic validation. Fluid-flow is traditionally modeled using an Eulerian description in association with finite differences and, more recent ...
Consensus is at the heart of fault-tolerant distributed computing systems. Much research has been devoted to developing algorithms for this particular problem. This paper presents a semi-automatic verification approach for asynchronous consensus algorithms ...
We consider the problem of neural association for a network of non-binary neurons. Here, the task is to recall a previously memorized pattern from its noisy version using a network of neurons whose states assume values from a finite number of non-negative ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
Let G be a finite group, let p be a prime number, and let K be a field of characteristic 0 and k be a field of characteristic p, both large enough. In this note, we state explicit formulae for the primitive idempotents of the ring of p-permutation kG-modul ...
The aim of this work is to understand the decomposition, in irreducible modules, of tensor products of Weil modules for Sp2n(3). To do this, we begin by computing the Weil modules for Sp4(3), Sp6(3) and Sp8(3) in order to understand how tensor products dec ...