Method and apparatus for multiple object tracking with k-shortest paths
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.
Systems and methods for tracking interacting objects may acquire, with a sensor, and two or more images associated with two or more time instances. A processor may generate image data from the two or more images. The processor may apply an extended Probabi ...
East Coast Fever (ECF) is a major livestock disease caused by Theileria parva Theiler, 1904, an emo-parasite protozoan transmitted by the tick Rhipicephalus appendiculatus Neumann, 1901. This disease provokes high mortality in cattle populations of East an ...
We present preliminary results from the Linked Books project, which aims at analysing citations from the histo- riography on Venice. A preliminary goal is to extract and parse citations from any location in the text, especially footnotes, both to primary a ...
In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G (n, r(n), f) of n nodes independently distributed in S = -1/2, 1/2 according to a certain density f(.). In the first part ...
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that ...
Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...
Institute of Electrical and Electronics Engineers2015
Let P be a set of n > d points in for d >= 2. It was conjectured by Zvi Schur that the maximum number of (d-1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P, is n. We prove this statement under the condition that any ...
Robust programs with modulated uncertainty sets are problems in which the uncertainty sets are treated as optimization variables. In many applications, these uncertainty sets can be interpreted as reserve capacities for which rewards are offered. One examp ...
Revenue management (RM) can be considered an application of operations research in the transportation industry. For these service companies, it is a difficult task to adjust supply and demand. In order to maximize revenue, RM systems display demand behavio ...
Overcomplete transforms have received considerable attention over the past years. However, they often suffer from a complexity burden. In this paper, a low complexity approach is provided, where an orthonormal basis is complemented with a set of incomplete ...
