Publications related to Special functions

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Fast and Provable ADMM for Learning with Generative Priors

Volkan Cevher, Armin Eftekhari, Fabian Ricardo Latorre Gomez

In this work, we propose a (linearized) Alternating Direction Method-of-Multipliers (ADMM) algorithm for minimizing a convex function subject to a nonconvex constraint. We focus on the special case where such constraint arises from the specification that a ...

2019

Pairs of majority-decomposing functions

Giovanni De Micheli, Mathias Soeken, Eleonora Testa

We are interested in decompositions xnf1f2 of the majority function over n odd arguments x1, ...,xnsuch that f1and f2do not depend on xn. In this paper, we derive the conditions for f1and f2that satisfy the decomposition. Such decompositions play a centr ...

2018

Perivascular macrophages in health and disease

Michele De Palma

Macrophages are a heterogeneous group of cells that are capable of carrying out distinct functions in different tissues, as well as in different locations within a given tissue. Some of these tissue macrophages lie on, or close to, the outer (abluminal) su ...

Nature Publishing Group2018

A New Coding Paradigm for the Primitive Relay Channel

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to ...

IEEE2018

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases, including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little attention by c ...

Association for Computing Machinery2017

Unlocking efficiency and scalability of reversible logic synthesis using conventional logic synthesis

Mathias Soeken, Anupam Chattopadhyay

Latest quantum technologies promise realization of extremely large circuits, whereas, reversible logic synthesis, the key automation step for quantum computing suffers from scalability bottleneck. Sealability can be achieved with Decision Diagram (DD)-base ...

ACM/IEEE2016

On the Kernel of the Cooray–Rubinstein Formula in the Time Domain

The kernel of the Cooray-Rubinstein formula in the time domain involves a modified Bessel function of order zero. In this letter, approximations of the kernel are proposed, which do not use any special function, and, hence, are able to simplify the numeric ...

Institute of Electrical and Electronics Engineers2016

Sparse molecular image representation

Pascal Frossard, Sofia Karygianni

Sparsity-based models have proven to be very effective in most image processing applications. The notion of sparsity has recently been extended to structured sparsity models where not only the number of components but also their support is important. This ...

Elsevier2016

Special functions

Graph Chatbot

Chat with Graph Search

Fast and Provable ADMM for Learning with Generative Priors

Pairs of majority-decomposing functions

Perivascular macrophages in health and disease

A New Coding Paradigm for the Primitive Relay Channel

Irreducible components of exotic Springer fibres

Maximizing Symmetric Submodular Functions

Unlocking efficiency and scalability of reversible logic synthesis using conventional logic synthesis

On the Kernel of the Cooray–Rubinstein Formula in the Time Domain

Large subsets of discrete hypersurfaces in Z d contain arbitrarily many collinear points

Sparse molecular image representation

Fast and Provable ADMM for Learning with Generative Priors

Pairs of majority-decomposing functions

A New Coding Paradigm for the Primitive Relay Channel

Irreducible components of exotic Springer fibres

Unlocking efficiency and scalability of reversible logic synthesis using conventional logic synthesis

On the Kernel of the Cooray–Rubinstein Formula in the Time Domain

Perivascular macrophages in health and disease

Maximizing Symmetric Submodular Functions

Sparse molecular image representation

Large subsets of discrete hypersurfaces in Z d contain arbitrarily many collinear points