Concept

Computability

Related publications (33)

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.

Undecidability through Fourier series

In computability theory a variety of combinatorial systems are encountered (word problems, production systems) that exhibit undecidability properties. Here we seek such structures in the realm of Analysis, more specifically in the area of Fourier Analysis. ...

Elsevier Science Bv2016

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

Analysis of Descent-Based Image Registration

Pascal Frossard, Elif Vural

We present a performance analysis for image registration with gradient descent. We consider a typical multiscale registration setting where the global 2-D translation between a pair of images is estimated by smoothing the images and minimizing the distance ...

2013

Analysis of Descent-Based Image Registration

Pascal Frossard, Elif Vural

We present a performance analysis for image registration with gradient descent methods. We consider a typical multiscale registration setting where the global 2-D translation between a pair of images is estimated by smoothing the images and minimizing the ...

2013

Indoor Navigation with a Swarm of Flying Robots

Dario Floreano, Jean-Christophe Zufferey, Timothy Stirling, James Roberts

Swarms of flying robots are promising in many applications due to rapid terrain coverage. However, there are numerous challenges in realising autonomous operation in unknown indoor environments. A new autonomous flight methodology is presented using relati ...

IEEE2012

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

Challenges and Opportunities in Self-Managing Scientific Databases

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Thomas Heinis, Ioannis Alagiannis, Farhan Tauheed

Advances in observation instruments and abundance of computational power for simulations encourage scientists to gather and produce unprecedented amounts of increasingly complex data. Organizing data automatically to enable efficient and unobstructed acces ...

2011

A Mobile World of Security

Christine Neuberg

Security in mobile communications is a topic of increasing relevance in everyday life. We all use mobile devices for everyday communications, maybe even for exchanging confidential information with the work place. This requires security systems that are re ...

EPFL2011

Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

Matthias Seeger

We propose a novel algorithm to solve the expectation propagation relaxation of Bayesian inference for continuous-variable graphical models. In contrast to most previous algorithms, our method is provably convergent. By marrying convergent EP ideas from (O ...

2011

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