: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
As the proliferation of pervasive and ubiquitous computing devices continues, users will carry more devices. Without the ability for these devices to unobtrusively interact with on...
Jonathan Lester, Blake Hannaford, Gaetano Borriell...
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...