Publication

From linear separability to unimodality: a hierarchy of pseudo-boolean functions

Related publications (35)

Graph Chatbot

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.

Analytic twists of modular forms and applications

Alexandre François Peyrot

We are interested in the study of non-correlation of Fourier coefficients of Maass forms against a wide class of real analytic functions. In particular, the class of functions we are interested in should be thought of as some archimedean analogs of Frobeni ...

EPFL2017

Exact simulation of max-stable processes

Sebastian Engelke, Clément Dombry

Max-stable processes play an important role as models for spatial extreme events. Their complex structure as the pointwise maximum over an infinite number of random functions makes their simulation difficult. Algorithms based on finite approximations are o ...

Oxford University Press2016

A Study of Capability-Based Effect Systems

Fengyun Liu

The problem of effect polymorphism is a major obstacle to wide adoption of effect systems in the programming community. The absence of effect systems reduces compiler optimization opportunities and disables effect constraints on APIs in parallel and distri ...

2016

Ellipse-Preserving Hermite Interpolation and Subdivision

Michaël Unser

We introduce a family of piecewise-exponential functions that have the Hermite interpolation property. Our design is motivated by the search for an effective scheme for the joint interpolation of points and associated tangents on a curve with the ability t ...

Elsevier2015

The Chaining Lemma and Its Application

Sebastian Faust

We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X-(0) with high min-entropy and a number (say, t in total) of arbitrary functions (T-1,.. ...

Springer-Verlag Berlin2015

Exponential convergence of the hp version of isogeometric analysis of 1D

Annalisa Buffa

We establish exponential convergence of the hp-version of isogeometric analysis for second order elliptic problems in one spacial dimension. Specifically, we construct, for functions which are piecewise analytic with a finite number of algebraic singularit ...

Springer, Cham2014

Mixed Potentials for Planar Multilayered Structures Including Conductive Interfaces

Juan Ramon Mosig, Michael Mattes, Ioannis Koufogiannis

A complete and automatized strategy has been developed to derive the Vector and Scalar Potential Green’s Functions (GFs) of planar multilayered structures that include conductive sheets. The propagator matrix technique is enhanced to include conductive she ...

2014

The centre cannot hold: untangling two different trajectories of the 'approaches to learning'framework

Roland John Tormey

The ‘deep/surface approach to learning’ framework is widely used in higher education. Its perceived strength is that it is regarded as having two functions: both being (1) a useful metaphor for development of teaching and learning in higher education and ( ...

2014

Euclidean Distance Matrices

Reza Parhizkar

Euclidean distance matrices (EDMs) are central players in many diverse fields including psychometrics, NMR spectroscopy, machine learning and sensor networks. However, they are not often exploited in signal processing. In this thesis, we analyze attributes ...

EPFL2013

L (p) error estimates for approximation by Sobolev splines and Wendland functions on a"e (d)

John Paul Ward

It is known that a Green's function-type condition may be used to derive rates for approximation by radial basis functions (RBFs). In this paper, we introduce a method for obtaining rates for approximation by functions which can be convolved with a finite ...

Springer US2013