Concept

Two-body problem

Related publications (82)

Hardness of Approximating Flow and Job Shop Scheduling Problems

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

Beating the Efficiency of Both Quantum and Classical Simulations with a Semiclassical Method

Jiri Vanicek, Cesare Mollica

While rigorous quantum dynamical simulations of many-body systems are extremely difficult (or impossible) due to exponential scaling with dimensionality, the corresponding classical simulations ignore quantum effects. Semiclassical methods are generally mo ...

American Physical Society2011

Fast Structure from Motion for Planar Image Sequences

Pierre Vandergheynst, Luigi Bagnato, Andreas Weishaupt

Dense three-dimensional reconstruction of a scene from images is a challenging task. Usually, it is achieved by finding correspondences in successive images and computing the distance by means of epipolar geometry. In this paper, we propose a variational f ...

2010

Tracking and Structure from Motion

Pierre Vandergheynst, Luigi Bagnato, Emmanuel D'Angelo, Andreas Weishaupt

Dense three-dimensional reconstruction of a scene from images is a very challenging task. In the structure from motion approach one of the key points is to compute depth maps which contain the distance of objects in the scene to a moving camera. Usually, t ...

2010

Implications Of Scale Relativity In Gravitational And Electromagnetic Field Theory

Maria-Alexandra Paun

A non-differentiable mechanical model (an alternative to Nottale's Scale Relativity Theory) considering that the particles movements takes place on Peano fractal curves is built. A Navier-Stokes type equation with an imaginary viscosity coefficient for a c ...

2010

Conditional hardness of precedence constrained scheduling on identical machines

Ola Nils Anders Svensson

Already 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. Till this date it has remained th ...

ACM2010

Two-Soliton Solutions to the Three-Dimensional Gravitational Hartree Equation

Joachim Krieger

We construct nondispersive two-soliton solutions to the three-dimensional gravitational Hartree equation whose trajectories asymptotically reproduce the non-trapped dynamics of the gravitational two-body problem. (C) 2009 Wiley Periodicals, Inc. ...

Wiley-Blackwell2009

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

2009

Optical Flow and Depth from Motion for Omnidirectional Images using a TV-L1 Variational Framework on Graphs

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the problem in the natural spherical geometry associated with these devices and ext ...

2009

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.