Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
Peter Nillius, Josephine Sullivan, Stefan Carlsson
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
In modern IC design, the number of long on-chip wires has been growing rapidly because of the increasing circuit complexity. Interconnect delay has dominated over gate delay as te...
Jill H. Y. Law, Evangeline F. Y. Young, Royce L. S...
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
Jorge G. Barbosa, C. N. Morais, R. Nobrega, A. P. ...
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...