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.
Lattice codes used under the compute-and-forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): the receiver succes- sively decodes the integer linear combinations of the messages until it can invert and r ...
Institute of Electrical and Electronics Engineers2017
Building on Viazovska’s recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing. In particul ...
The recently discovered type-II Weyl points appear at the boundary between electron and hole pockets. Type-II Weyl semimetals that host such points are predicted to exhibit a new type of chiral anomaly and possess thermodynamic properties very different fr ...
In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...
This article deals with the use of optimal lattice and optimal window in Discrete Gabor Transform computation. In the case of a generalized Gaussian window, extending earlier contributions, we introduce an additional local window adaptation technique for n ...
In this talk we will speak about recent progress on the sphere packing problem. The packing problem can be formulated for a wide class of metric spaces equipped with a measure. An interesting feature of this optimization problem is that a slight change of ...
We provide a process on the space of collections of coalescing cadlag stable paths and show convergence in an appropriate topology for coalescing stable random walks on the integer lattice. ...
Let M be a quotient of H-2 x ... x H-2 (product of hyperbolic planes) by a uniform lattice of. PSL2(R))(n). We prove that, among metrics of M of prescribed volume, the sum of hyperbolic metrics has minimal volume entropy. ...
Motivated by recent experimental progress in the context of ultra-cold multi-colour fermionic atoms in optical lattices, this thesis investigates the properties of the antiferromagnetic SU(N) Heisenberg models with fully antisymmetric irreducible represent ...
We consider rank-1 lattices for integration and reconstruction of functions with series expansion supported on a finite index set. We explore the connection between the periodic Fourier space and the non-periodic cosine space and Chebyshev space, via tent ...
