Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Computability

Publications associées (15)

Optimizing Dynamic Aperture Studies with Active Learning

Tatiana Pieloni, Mike Seidel, Davide Di Croce, Ekaterina Krymova

Dynamic aperture is an important concept for the study of non-linear beam dynamics in circular accelerators. It describes the extent of the phase-space region where a particle's motion remains bounded over a given number of turns. Understanding the feature ...

Iop Publishing Ltd2024

Textual Explanations and Critiques in Recommendation Systems

Diego Matteo Antognini

Artificial intelligence and machine learning algorithms have become ubiquitous. Although they offer a wide range of benefits, their adoption in decision-critical fields is limited by their lack of interpretability, particularly with textual data. Moreover, ...

EPFL2022

On Succinct Non-interactive Arguments in Relativized Worlds

Alessandro Chiesa

Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Magnetization-prepared 2 Rapid Gradient-Echo MRI for B-1 Insensitive 3D T1 Mapping of Hip Cartilage: An Experimental and Clinical Validation

Tobias Kober

Background: Often used for T1 mapping of hip cartilage, three-dimensional (3D) dual-flip-angle (DFA) techniques are highly sensitive to flip angle variations related to B-1 inhomogeneities. The authors hypothesized that 3D magnetization-prepared 2 rapid gr ...

RADIOLOGICAL SOC NORTH AMERICA2021

Genetic-optimised aperiodic code for distributed optical fibre sensors

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Zhisheng Yang, Simon Adrien Zaslawski, Sheng Wang

Distributed optical fibre sensors deliver a map of a physical quantity along an optical fibre, providing a unique solution for health monitoring of targeted structures. Considerable developments over recent years have pushed conventional distributed sensor ...

Nature Research2020

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

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

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 ...

Springer2010

Adaptive query execution for data management in the cloud

Anastasia Ailamaki, 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

Robust, High-Speed Interest Point Matching for Real-Time Applications

Michael Calonder

A typical Computer Vision system needs to process vast amounts of data as captured by one or more cameras, constantly testing the capabilities of today's hardware. Yet such systems face an ever-growing computational load caused by the more and more demandi ...

EPFL2010

A Tighter Analysis of Work Stealing

Nicolas Gabriel Gast

Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost for managing a single centralized list becomes prohibitive. The objective of this wor ...

Springer Berlin Heidelberg2010

The Semantics of Progress in Lock-Based Transactional Memory

Rachid Guerraoui

Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to precisely define TM semantics, especially their progress guarantees. This pape ...

ACM2009

On Learning the Statistical Representation of a Task and Generalizing it to Various Contexts

Aude Billard, Sylvain Calinon, Florent Günter

This paper presents an architecture for solving generically the problem of extracting the relevant features of a given task in a programming by demonstration framework and the problem of generalizing the acquired knowledge to various contexts. We validate ...

2006