Publications associées à BDD Minimization for Approximate Computing

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.

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

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

BDD Minimization for Approximate Computing

Graph Chatbot

Chattez avec 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

Sampling at unknown locations, with an application in surface retrieval

Effects as Implicit Capabilities

PostScript in IPython notebooks

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

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)

On linear and quadratic Lipschitz bounds for twice continuously differentiable functions

Function computation via subspace coding

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