Concept

Computable function

Publications associées (118)

Improvements on "Fast Space-Variant Elliptical Filtering Using Box Splines"

It is well-known that box filters can be efficiently computed using pre-integration and local finite-differences. By generalizing this idea and by combining it with a nonstandard variant of the central limit theorem, we had earlier proposed a constant-time ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Extent-based incremental identification of reaction kinetics from spectroscopic data

Dominique Bonvin, Julien Léo Billeter, Sriniketh Srinivasan

Identification of kinetic models is an important step for the monitoring, control and optimization of chemical and pharmaceutical processes. Furthermore, the availability of a first-principles model often leads to substantial reduction in process developme ...

2012

Approximate Feedback Capacity of the Gaussian Multicast Channel

Michael Christoph Gastpar, Naveen Goela

We characterize the capacity region to within log {2(M − 1)} bits/s/Hz for the M -transmitter K -receiver Gaus- sian multicast channel with feedback where each receiver wishes to decode every message from the M transmitters. Extending Cover-Leung’s achieva ...

2012

MPC for tracking periodic reference signals

Colin Neil Jones, Melanie Nicole Zeilinger

This paper is devoted to the design of a predictive controller for constrained linear systems to track periodic references. The only assumption on the dynamics of the reference is that it is periodic and its period is known. It is also assumed that the ref ...

2012

Scenario-free stochastic programming with polynomial decision rules

Daniel Kuhn

Multi-stage stochastic programming provides a versatile framework for optimal decision making under uncertainty, but it gives rise to hard functional optimization problems since the adaptive recourse decisions must be modeled as functions of some or all un ...

IEEE2011

Sub-Logarithmic Test-and-Set Against a Weak Adversary

Dan Alistarh

A randomized implementation is given of a test-and-set register with O(log log it) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complex ...

Springer-Verlag Berlin2011

A Model Predictive Control Approach to Trajectory Tracking Problems via Time-Varying Level Sets of Lyapunov Functions

Timm Faulwasser

We discuss a model predictive control approach to trajectory tracking problems of constrained nonlinear con- tinuous time systems, where the reference trajectory is a priori known and asymptotically constant. The proposed NMPC scheme is able to explicitly ...

2011

The Complexity of Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

Estimating uncertainty of alcohol-attributable fractions for infectious and chronic diseases

Gerrit Gmel

Background: Alcohol is a major risk factor for burden of disease and injuries globally. This paper presents a systematic method to compute the 95% confidence intervals of alcohol-attributable fractions (AAFs) with exposure and risk relations stemming from ...

2011

Function computation via subspace coding

Christina Fragouli, 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 computing functions, that req ...

2010

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search