Publication

Method and apparatus for multiple object tracking with k-shortest paths

Related publications (260)

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.

An Improved Upper Bound for the ErdAs-Szekeres Conjecture

Let ES(n) denote the minimum natural number such that every set of ES(n) points in general position in the plane contains n points in convex position. In 1935, ErdAs and Szekeres proved that ES. In 1961, they obtained the lower bound , which they conjectur ...

Springer2016

Generalized Gauss Inequalities via Semidefinite Programming

Daniel Kuhn

A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming. However, this Chebyshev-type bound tends to ...

Springer Verlag2016

The effects of spatial attention on temporal integration

Michael Herzog, Marc Michael Lauffs

Feature fusion reflects temporal integration. Previous studies mostly employed foveal presentations with no attention manipulation. In this study we examined the effects of sustained spatial attention on temporal integration using feature-fusion with perip ...

Sage Publications Ltd2016

Bisector Energy and Few Distinct Distances

Frank de Zeeuw

We define the bisector energy E(P) of a set P in R-2 to be the number of quadruples (a, b, c, d) is an element of P-4 such that a, b determine the same perpendicular bisector as c, d. Equivalently, E(P) is the number of isosceles trapezoids determined by P ...

Springer2016

Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation

Volkan Cevher, Andreas Krause, Jonathan Mark Scarlett, Ilija Bogunovic

We present a new algorithm, truncated variance reduction (TruVaR), that treats Bayesian optimization (BO) and level-set estimation (LSE) with Gaussian processes in a unified fashion. The algorithm greedily shrinks a sum of truncated variances within a set ...

2016

Studying Linguistic Changes on 200 Years of Newspapers

Frédéric Kaplan, Vincent Christian Buntinx, Cyril Antoine Michel Bornet

Large databases of scanned newspapers open new avenues for studying linguistic evolution. By studying a two-billion-word corpus corresponding to 200 years of newspapers, we compare several methods in order to assess how fast language is changing. After cri ...

2016

Probabilistic Derivation of Spatiotemporal Correlation Functions in the Hydrodynamic Limit

Sara Bonella, Mauro Ferrario

In this paper, we use probability theory to prove in suitable conditions the equivalence of equilibrium time correlation functions of microscopic density fields with the time correlation functions of local macroscopic density fields evolved by hydrodynamic ...

Amer Chemical Soc2016

Eulerian theory of newtonian deformable lattices – dislocation and disclination charges in solids

Gérard Gremaud

This book lays methodically the foundations of an original approach of the solid lattices deformation using the Euler coordinates, and introduces in details the concept of tensor dislocation charges and tensor disclination charges within a lattice. This ne ...

Amazon2016

A Robust Resolution of Newcomb's Paradox

Thomas Alois Weber

Newcomb's problem is viewed as a dynamic game with an agent and a superior being as players. Depending on whether or not a risk-neutral agent's confidence in the superior being, as measured by a subjective probability assigned to the move order, exceeds a ...

2016

Stuck Walks: A Conjecture Of Erschler, Toth And Werner

Daniel Kious

In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of next-to-neighbori ...

Inst Mathematical Statistics2016