Publications associées à Image coding with incomplete transforms competition for HEVC

A smooth basis for atomistic machine learning

Michele Ceriotti, Kevin Kazuki Huguenin-Dumittan, Filippo Bigi

Machine learning frameworks based on correlations of interatomic positions begin with a discretized description of the density of other atoms in the neighborhood of each atom in the system. Symmetry considerations support the use of spherical harmonics to ...

AIP Publishing2022

Stretchable tubular device and use thereof as a counterpulsation device

Yves Perriard, Yoan René Cyrille Civet, Thomas Guillaume Martinez, Jonathan André Jean-Marie Chavanne, Morgan Almanza

The present invention is related to a stretchable tubular device (1) comprising at least one layer (Lx) of a stretchable polymer, a power supply (2) and a set of electrodes (3a, 3b) connected to said power supply (2). The power supply can supply at least a ...

2021

Optimal radial basis for density-based atomic representations

Michele Ceriotti, Sergey Pozdnyakov, Jigyasa Nigam, Félix Benedito Clément Musil, Alexander Jan Goscinski

The input of almost every machine learning algorithm targeting the properties of matter at the atomic scale involves a transformation of the list of Cartesian atomic coordinates into a more symmetric representation. Many of the most popular representations ...

AIP Publishing2021

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

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

EPFL Library Research Data Management Fastguides

Francesco Varrato, Antoine Louis Claude Masson, Eliane Ninfa Blumer, Sitthida Samath, Fantin Reichler, Jérôme Julien Chaptinel

This is a set of 11 1-sheet guides, providing abridged notions, advice and references for quick and practical research data management: #01 Research Data: the basics #02 FAIR Data Principles #03 Cost of Research Data Management #04 File Formats #05 Metadat ...

2019

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

Point and sensor estimation from images

Martin Vetterli, Adam James Scholefield, Alireza Ghasemi

System comprising at least one sensor configured to take a set of images from different viewpoints of a scene; a processor configured to identifying a point source represented in the images of a set of images; computing for each image of the set of images ...

2017

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.

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Image coding with incomplete transforms competition for HEVC

On the boundedness of n-folds with κ(X) = n - 1

A smooth basis for atomistic machine learning

Stretchable tubular device and use thereof as a counterpulsation device

Optimal radial basis for density-based atomic representations

New Results in Integer and Lattice Programming

On compact representations of Voronoi cells of lattices

EPFL Library Research Data Management Fastguides

In response to ‘Six critical questions about smart spezialisation’

On compact representations of Voronoi cells of lattices

Point and sensor estimation from images

Graph Chatbot

Chattez avec Graph Search

New Results in Integer and Lattice Programming

On compact representations of Voronoi cells of lattices

Optimal radial basis for density-based atomic representations

A smooth basis for atomistic machine learning

EPFL Library Research Data Management Fastguides

On compact representations of Voronoi cells of lattices

In response to ‘Six critical questions about smart spezialisation’

On the boundedness of n-folds with κ(X) = n - 1

Stretchable tubular device and use thereof as a counterpulsation device

Point and sensor estimation from images