Publications associées à Structure from motion in dynamic scenes with multiple motions

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

2024

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Sketches, metrics and fast algorithms

Navid Nouri

As it has become easier and cheaper to collect big datasets in the last few decades, designing efficient and low-cost algorithms for these datasets has attracted unprecedented attention. However, in most applications, even storing datasets as acquired has ...

EPFL2022

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...

2021

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

A Reinforcement Learning Approach to Train Routing and Scheduling

Zora Oswald

Good train scheduling for a big network with many trains is very hard to achieve. As the trains are competing for the tracks with one another, the number of constraints grows rapidly. Trying to take advantage of emerging technologies in the areas of optimi ...

2020

Freight railway network design problem

Michel Bierlaire, Virginie Janine Camille Lurkin, Nikola Obrenovic

In freight railway networks, commodities are usually transported via hubs, which are called marshaling or shunting yards, depending on their capacity. Consequently, the number and locations of these yards effect the transport costs to a great extent. The ...

2018

Obstacle detection for lake-deployed autonomous surface vehicles using RGB imagery

David Andrew Barry, Philippe Olivier Paccaud

We describe and test an obstacle-detection system for small, lake-deployed autonomous surface vehicles (ASVs) that relies on a low-cost, consumer-grade camera and runs on a single-board computer. A key feature of lakes that must be accounted for is the fre ...

2018

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

Structure from motion in dynamic scenes with multiple motions

Graph Chatbot

Chattez avec Graph Search

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Sketches, metrics and fast algorithms

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

New Results in Integer and Lattice Programming

A Reinforcement Learning Approach to Train Routing and Scheduling

Freight railway network design problem

Obstacle detection for lake-deployed autonomous surface vehicles using RGB imagery

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Dynamic Facility Location via Exponential Clocks

New Results in Integer and Lattice Programming

A Reinforcement Learning Approach to Train Routing and Scheduling

Sketches, metrics and fast algorithms

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Obstacle detection for lake-deployed autonomous surface vehicles using RGB imagery

Dynamic Facility Location via Exponential Clocks

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Freight railway network design problem