Concept

Matrice de Dirac

Publications associées (108)

Non-filamentary non-volatile memory elements as synapses in neuromorphic systems

Yusuf Leblebici, Alessandro Fumarola, Severin Sidler

Crossbar arrays of non-volatile memory (NVM) devices represent one possible path for implementing highly energy-efficient neuromorphic computing systems. For Deep Neural Networks (DNN), where information can be encoded as analog voltage and current levels, ...

IEEE2019

Faster Algorithms for Integer Programs with Block Structure

Friedrich Eisenbrand, Kim-Manuel Klein, Christoph Hunkenschröder

We consider integer programming problems max {c^Tx : A x = b, l

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2018

Immuno-affinity Amperometric Detection of Bacterial Infections

Hubert Girault, Horst Pick, Andreas Stephan Lesch, Michel Prudent, Milica Jovic, Yingdi Zhu

A combination of an immuno-affinity enrichment strategy and sensitive amperometric read-out was implemented in a point-of-care platform intended for bacterial infection analysis. Bacterial cells, selectively captured and enriched from complex matrices thro ...

WILEY-V C H VERLAG GMBH2018

MATHICSE Technical Report : Quasi-Toeplitz matrix arithmetic : a Matlab toolbox

Stefano Massei

A Quasi Toeplitz (QT) matrix is a semi-infinite matrix of the kind

A = T(a) + E

where

T(a) = (aj-i)_{i,j\in \mathbb{Z}_{+}}

E = (e_{i,j})_{i,j\in\mathbb{Z}_{+}}

is compact and the norms

\| a\|_{\mathcal{W}} =\sum_{i\in\mathbb{Z}} |a|_j

and $|E|_{ ...

MATHICSE2018

The Mutual Information in Random Linear Estimation Beyond i.i.d. Matrices

Nicolas Macris, Florent Gérard Krzakala, Jean François Emmanuel Barbier

There has been definite progress recently in proving the variational single-letter formula given by the heuristic replica method for various estimation problems. In particular, the replica formula for the mutual information in the case of noisy linear esti ...

IEEE2018

Polarization of the Renyi Information Dimension With Applications to Compressed Sensing

Emmanuel Abbé, Saeid Haghighatshoar

In this paper, we show that the Hadamard matrix acts as an extractor over the reals of the Renyi Information Dimension (RID), in an analogous way to how it acts as an extractor of the discrete entropy over finite fields. More precisely, we prove that the R ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Virus inactivation in stored human urine, sludge and animal manure under typical conditions of storage or mesophilic anaerobic digestion

Tamar Kohn, Loïc Decrey

Viruses represent major disease transmitting agents carried by human excreta and animal manure. Understanding virus inactivation is therefore essential in preventing microbial spread due to inadequate treatment of these materials. Here, we investigated the ...

Royal Soc Chemistry2017

(Invited) Point-of-Care Diagnostics with Inkjet-Printed Microchips

Hubert Girault, Frédéric Gumy, Andreas Stephan Lesch, Milica Jovic, Yingdi Zhu, Marie Camille Isabelle Baudoz

Multi-layer inkjet printing is applied to prepare microchips that consist of up to eight three-electrode sensors comprising a carbon nanotube (CNT) working electrode, a silver/silver chloride quasireference electrode and a CNT counter electrode. Optionally ...

Electrochemical Society2017

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

Volkan Cevher, Jonathan Mark Scarlett

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achievability and converse bounds are known in several cases of interest for i.i ...

Ieee2016

Convex block-sparse linear regression with expanders - provably

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis, Luca Baldassarre, Bubacarr Bah

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-ti ...

2016

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.

Connectez-vous pour utiliser Chat avec Graph Search