Publications associées à Bibliothèque standard du C++

Bayesian reconstruction of memories stored in neural networks from their connectivity

Florent Gérard Krzakala, Lenka Zdeborová

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

2023

HP - A code for the calculation of Hubbard parameters using density-functional perturbation theory

Nicola Marzari, Iurii Timrov, Matteo Cococcioni

We introduce HP, an implementation of density-functional perturbation theory, designed to compute Hubbard parameters (on-site U and inter-site V ) in the framework of DFT+U and DFT+U+V. The code does not require the use of computationally expensive superce ...

ELSEVIER2022

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Adam Teodor Polak

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...

Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Michaël Unser, Shayan Aziznejad, Thomas Jean Debarre

We present a novel framework for the reconstruction of 1D composite signals assumed to be a mixture of two additive components, one sparse and the other smooth, given a finite number of linear measurements. We formulate the reconstruction problem as a cont ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Sparse Recovery of Strong Reflectors With an Application to Non-Destructive Evaluation

Jean-Philippe Thiran, Martin Vetterli, Dimitris Perdios, Eric Bezzam, Adrien Georges Jean Besson, Hanjie Pan

In this paper we show that it is sufficient to recover the locations of K strong reflectors within an insonified medium from three receive elements and 2K+1 samples per element. The proposed approach leverages advances in sampling signals with a finite rat ...

IEEE2018

Sparse Recovery of Strong Reflectors With an Application to Non-Destructive Evaluation

Jean-Philippe Thiran, Martin Vetterli, Dimitris Perdios, Eric Bezzam, Adrien Besson, Hanjie Pan

IEEE2018

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

Auto-Collections for Scala

Dmytro Petrashko, Allan Vincent Roger Renucci

Modern programming languages such as Scala, Java and C# make extensive use of collections. A collection implementation represents a fixed choice in the dimensions of operation time and space utilization. Using the collection in a manner not consistent with ...

2016

Improving the Interoperation between Generics Translations

Martin Odersky, Nicolas Alexander Stucki, Vlad Ureche, Romain Michel Beguet, Milos Stojanovic

Generics on the Java platform are compiled using the erasure transformation, which only supports by-reference values. This causes slowdowns when generics operate on primitive types, such as integers, as they have to be transformed into reference-based obje ...

ACM2015

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.

Bibliothèque standard du C++

Bayesian reconstruction of memories stored in neural networks from their connectivity

HP - A code for the calculation of Hubbard parameters using density-functional perturbation theory

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

HALucinator: Firmware Re-hosting Through Abstraction Layer Emulation

Sparse Recovery of Strong Reflectors With an Application to Non-Destructive Evaluation

Sparse Recovery of Strong Reflectors With an Application to Non-Destructive Evaluation

Dynamic Facility Location via Exponential Clocks

Auto-Collections for Scala

Improving the Interoperation between Generics Translations

Graph Chatbot

Chattez avec Graph Search

Dynamic Facility Location via Exponential Clocks

HALucinator: Firmware Re-hosting Through Abstraction Layer Emulation

Bayesian reconstruction of memories stored in neural networks from their connectivity

Sparse Recovery of Strong Reflectors With an Application to Non-Destructive Evaluation

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

HP - A code for the calculation of Hubbard parameters using density-functional perturbation theory

Auto-Collections for Scala

Sparse Recovery of Strong Reflectors With an Application to Non-Destructive Evaluation

Improving the Interoperation between Generics Translations