Concept

Topologie compacte-ouverte

Publications associées (16)

Communication-efficient distributed training of machine learning models

Thijs Vogels

In this thesis, we explore techniques for addressing the communication bottleneck in data-parallel distributed training of deep learning models. We investigate algorithms that either reduce the size of the messages that are exchanged between workers, or th ...
EPFL2023

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) 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 ...
SPRINGER HEIDELBERG2020

Convergence analysis of Padé approximations for Helmholtz frequency response problems

Fabio Nobile, Francesca Bonizzoni

The present work concerns the approximation of the solution map SS associated to the parametric Helmholtz boundary value problem, i.e., the map which associates to each (real) wavenumber belonging to a given interval of interest the corresponding solution ...
2018

Periodic cellular aluminum structures for space applications

Florian Thibaut Gallien

Mass is one of the crucial parameters for hardware that has to be placed in Earth orbit. Due to its harsh environment, a material with highest specific properties is desired to achieve space missions. The rise and development of new technologies, such as a ...
EPFL2018

Reuse in Architecture & Structural Design

Jan Friedrich Georg Brütting

Introduction The construction industry has an extensive impact on the global environment and will be facing three big challenges in the next decades: reducing its resource consumption, decreasing its energy use, and limiting its waste production. This is e ...
2018

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

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 ...
SPRINGER INTERNATIONAL PUBLISHING AG2018

Topological Structures on DMC spaces

Rajai Nasser

Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet X and output alphabet Y can be naturally endowed with the quotient of the Euclidean topology by the equivalence relation. We s ...
2017

MATHICSE Technical Report :Convergence analysis of Padé approximations for Helmholtz frequency response problems

Fabio Nobile, Francesca Bonizzoni

The present work concerns the approximation of the solution map S associated to the parametric Helmholtz boundary value problem, i.e., the map which associates to each (real) wavenumber belonging to a given interval of interest the corresponding solution o ...
MATHICSE2016

Large field excursions and approximate discrete symmetries from a clockwork axion

Riccardo Rattazzi

We present a renormalizable theory of scalars in which the low-energy effective theory contains a pseudo-Goldstone boson with a compact field space of 2 pi F and an approximate discrete shift symmetry Z(Q) with Q >> 1, yet the number of fields in the theor ...
Amer Physical Soc2016

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.