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

Concept

Mouvement à force centrale

Publications associées (28)

Mechanisms for actuated assistive hip orthoses

Hannes Bleuler, Mohamed Bouri, Jeremy Olivier, Amalric Louis Ortlieb

Mobility is often a central problem for people having muscle weaknesses. The need for new devices to assist walking and walk related activities is therefore growing. Lower limb actuated orthoses have already proven their positive impact with paraplegic pat ...

Elsevier2014

On the DCJ Median Problem

Bernard Moret, Mingfu Shao

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...

Springer-Verlag Berlin2014

Sampling and reconstructing diffusion fields in presence of aliasing

Martin Vetterli, Juri Ranieri

The reconstruction of a diffusion field, such as temperature, from samples collected by a sensor network is a classical inverse problem and it is known to be ill-conditioned. Previous work considered source models, such as sparse sources, to regularize the ...

2013

Euclidean Distance Matrices : Properties, Algorithms and Applications

Reza Parhizkar

Euclidean distance matrices (EDMs) are central players in many diverse fields including psychometrics, NMR spectroscopy, machine learning and sensor networks. However, they are not often exploited in signal processing. In this thesis, we analyze attributes ...

EPFL2013

A High–Performance Parallel Implementation of the Chambolle Algorithm

David Atienza Alonso, Abdulkadir Akin, Ivan Beretta, Alessandro Antonio Nacci

The determination of the optical flow is a central problem in image processing, as it allows to describe how an image changes over time by means of a numerical vector field. The estimation of the optical flow is however a very complex problem, which has be ...

ACM and IEEE Press2011

Hardness of Approximating Flow and Job Shop Scheduling Problems

Ola Nils Anders Svensson

We consider several variants of the job shop problem that is a fundamental and classical problem in scheduling. The currently best approximation algorithms have worse than logarithmic performance guarantee, but the only previously known inapproximability r ...

2011

Hardness Of Precedence Constrained Scheduling On Identical Machines

Ola Nils Anders Svensson

In 1966, Graham showed that a simple procedure called list scheduling yields a 2-approximation algorithm for the central problem of scheduling precedence constrained jobs on identical machines to minimize makespan. To date this has remained the best algori ...

2011

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

We address the problem of depth and ego-motion estimation from omnidirectional images. We propose a correspondence-free structure from motion problem for images mapped on the 2-sphere. A novel graph-based variational framework is proposed for depth estimat ...

Springer Verlag2011