Publications associées à Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

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

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Graph Chatbot

Chattez avec Graph Search

Stable parameterization of continuous and piecewise-linear functions

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Nothing New Under the Sun: Novelty Constructs and Measures in Social Studies

A New Channel-Base Lightning Current Formula With Analytically Adjustable Parameters

Pairs of majority-decomposing functions

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

BDD Minimization for Approximate Computing

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

Function computation via subspace coding

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Nothing New Under the Sun: Novelty Constructs and Measures in Social Studies

Pairs of majority-decomposing functions

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

A New Channel-Base Lightning Current Formula With Analytically Adjustable Parameters

Stable parameterization of continuous and piecewise-linear functions

Function computation via subspace coding

BDD Minimization for Approximate Computing

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