Publications related to An Exact Relation Between Willingness To Pay and Willingness To Accept

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

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We analyze the accuracy of the discrete least-squares approximation of a function

u

in multivariate polynomial spaces

P_\Lambda:=span\{y\mapsto y^\nu \,: \, \nu\in \Lambda\}

with

\Lambda\subset N_0^d

over the domain

\Gamma:=[-1,1]^d

, based on the s ...

2017

Side-Channel Attacks on Threshold Implementations using a Glitch Algebra

Serge Vaudenay

Threshold implementations allow to implement circuits us- ing secret sharing in a way to thwart side-channel attacks based on prob- ing or power analysis. It was proven they resist to attacks based on glitches as well. In this report, we show the limitatio ...

Springer Int Publishing Ag2016

BDD Minimization for Approximate Computing

Mathias Soeken, Arun Chandrasekharan

We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representa ...

IEEE2016

PostScript in IPython notebooks

Duncan Montana Forel

A python module containing the functionnalities for displaying LaTeX and PostScript code in an IPython notebook. ...

2016

Effects as Implicit Capabilities

Martin Odersky

We propose to investigate a new approach to effect checking that has an elegant solution to the effect polymorphism problem. The central idea is that instead of talking about effects we talk about capabilities. For instance, instead of saying a function “t ...

2015

MATHICSE Technical Report : Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We analyze the accuracy of the discrete least-squares approximation of a function u in multivariate polynomial spaces

P_\Lambda := span\{y \mapsto y^\nu | \nu \in \Lambda\}

with

\Lambda\subset N_0^d

over the domain

\Gamma := [-1,1]^d

, based on the sa ...

MATHICSE2015

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

On linear and quadratic Lipschitz bounds for twice continuously differentiable functions

Dominique Bonvin, Grégory François, Gene Bunin

Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic bounds that are state ...

arXiv:1406.3991 [math.OC]2014

Computation Over Gaussian Networks With Orthogonal Components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum f ...

Institute of Electrical and Electronics Engineers2014

An Exact Relation Between Willingness To Pay and Willingness To Accept

Graph Chatbot

Chat with Graph Search

Pairs of majority-decomposing functions

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Side-Channel Attacks on Threshold Implementations using a Glitch Algebra

BDD Minimization for Approximate Computing

PostScript in IPython notebooks

Effects as Implicit Capabilities

MATHICSE Technical Report : Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

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

On linear and quadratic Lipschitz bounds for twice continuously differentiable functions

Computation Over Gaussian Networks With Orthogonal Components

Pairs of majority-decomposing functions

MATHICSE Technical Report : Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

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

Side-Channel Attacks on Threshold Implementations using a Glitch Algebra

BDD Minimization for Approximate Computing

PostScript in IPython notebooks

Effects as Implicit Capabilities

On linear and quadratic Lipschitz bounds for twice continuously differentiable functions

Computation Over Gaussian Networks With Orthogonal Components