Publication

Structure from motion in dynamic scenes with multiple motions

Publications associées (51)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Distributed Rate Allocation for Network-coded Systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009

Distributed rate allocation for network-coded systems

Christina Fragouli, Amin Jafarian

2009

Detecting the Origin of Text Segments Efficiently

Monika Henzinger

In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in S in which the sequence ap ...

ACM2009

On Set-Driven Combination of Logics and Verifiers

Viktor Kuncak

We explore the problem of automated reasoning about the non-disjoint combination of logics that share set variables and operations. We prove a general combination theorem, and apply it to show the decidability for the quantifier-free combination of formula ...

2009

A Sparsity Constrained Inverse Problem to Locate People in a Network of Cameras

Pierre Vandergheynst, Alexandre Massoud Alahi, Laurent Jacques

A novel approach is presented to locate dense crowd of people in a network of fixed cameras given the severely degraded background subtracted silhouettes. The problem is formulated as a sparsity constrained inverse problem using an adaptive dictionary cons ...

2009

A Unified Framework for Joint Sink Mobility and Routing to Increase the Lifetime of Wireless Sensor Networks

Jean-Pierre Hubaux, Jun Luo

The longevity of wireless sensor networks is a major issue that impacts the application of such networks. While communication protocols are striving to save energy by acting on sensor nodes, recent results show that network lifetime can be prolonged by fur ...

2008

A new synthetic access to furo[3,2-f]chromene analogues of an antimycobacterial

Stewart Cole

From the structure of 3,3-dimethyl-3H-benzofuro[3,2-f][1]-benzopyran, a selective in vitro inhibitor of mycobacterial growth, we have undertaken a structure-activity relationship investigation. We wish to report here our results on the use of [2+3] cycload ...

2008

A Recovery Algorithm for a Disrupted Airline Schedule

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

The airline scheduling is a very large and complex problem. Moreover, it is common that only a minority of the initial schedules are carried out as planned because of delays, airport closures or other unforeseen events. Thus, given an actual state of the r ...

2007

Fibonacci Heaps

Ali Chekir, Mohamed Slim Slama

Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...

2006

Computing All Faces of the Minkowski Sum of V-Polytopes

Christophe Weibel

We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R^d. An algorithm for listing all faces of dimension up to j is presented, for any given 0

2005