Concept

Computable function

Related publications (118)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

2010

GENERALIZED FORM FACTORS FOR THE BEAM COUPLING IMPEDANCES IN A FLAT CHAMBER

Nicolas Frank Mounet

The exact formalism from B. Zotter to compute beam coupling impedances has been fully developed only in the case of an infinitely long circular beam pipe. For other two dimensional geometries, some form factors are known only in the ultrarelativistic case ...

2010

Function computation over linear channels

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

We consider multiple non-colocated sources commu- nicating over a network to a common sink. We assume that the network operation is fixed, and its end result is to convey a fixed linear deterministic transformation of the source data to the sink. This line ...

2010

On Satisfiability Modulo Computable Functions

Viktor Kuncak, Philippe Paul Henri Suter, Ali Sinan Köksal

We present a semi-decision procedure for checking satisfiability of formulas in the language of algebraic data types and integer linear arithmetic extended with user-defined terminating recursive functions. Our procedure is designed to integrate into a DPL ...

2010

Derivatives with respect to metrics and applications: subgradient marching algorithm

This paper introduces a subgradient descent algorithm to compute a Riemannian metric that minimizes an energy involving geodesic distances. The heart of the method is the Subgradient Marching Algorithm to compute the derivative of the geodesic distance wit ...

Springer-Verlag2010

On Deciding Functional Lists with Sublist Sets

Viktor Kuncak

Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functional lists. We first show how to decide in NP the satisfiability problem for lo ...

2010

Adaptive query execution for data management in the cloud

Anastasia Ailamaki, Debabrata Dash, Adrian Daniel Popescu

A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those offered by parallel DBMS. These techniques however, cannot guarantee high pe ...

ACM Press2010

Daisy: An Efficient Dense Descriptor Applied to Wide Baseline Stereo

Pascal Fua, Vincent Lepetit, Engin Tola

In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM based algorithm to compute dense depth and occlusion maps from wide baseline image pairs using this descriptor. This yields much ...

Institute of Electrical and Electronics Engineers2010

3D finite element model of semi-solid permeability in an equiaxed granular structure

Roland Logé

A multi-domain finite element formulation has been applied to determine the semi-solid permeability of an equiaxed granular structure. The granular model was constructed from a Voronoï tessellation algorithm. The liquid-solid interface is represented impli ...

2010

The scale axis picture show

Mark Pauly

We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of a shape, in a scale-adaptive manner. Here a shape O is any bounded open subs ...

2009