Publications related to BDD Minimization for Approximate Computing

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

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

Sampling at unknown locations, with an application in surface retrieval

Martin Vetterli, Benjamin Bejar Haro, Adam James Scholefield, Michalina Wanda Pacholska

We consider the problem of sampling at unknown locations. We prove that, in this setting, if we take arbitrarily many samples of a polynomial or real bandlimited signal, it is possible to find another function in the same class, arbitrarily far away from t ...

2017

PostScript in IPython notebooks

Duncan Montana Forel

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

2016

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

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

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

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

Fast Proton Exchange in Histidine: Measurement of Rate Constants through Indirect Detection by NMR Spectroscopy

Geoffrey Bodenhausen

Owing to its imidazole side chain, histidine participates in various processes such as enzyme catalysis, pH regulation, metal binding, and phosphorylation. The determination of exchange rates of labile protons for such a system is important for understandi ...

Wiley-Blackwell2014

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

Function computation via subspace coding

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for comput- ing functions, that r ...

2013

BDD Minimization for Approximate Computing

Graph Chatbot

Chat with Graph Search

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

Sampling at unknown locations, with an application in surface retrieval

PostScript in IPython notebooks

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

Effects as Implicit Capabilities

On linear and quadratic Lipschitz bounds for twice continuously differentiable functions

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

Fast Proton Exchange in Histidine: Measurement of Rate Constants through Indirect Detection by NMR Spectroscopy

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

Function computation via subspace coding

PostScript in IPython notebooks

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

Function computation via subspace coding

Sampling at unknown locations, with an application in surface retrieval

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

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

On linear and quadratic Lipschitz bounds for twice continuously differentiable functions

Fast Proton Exchange in Histidine: Measurement of Rate Constants through Indirect Detection by NMR Spectroscopy

Effects as Implicit Capabilities