The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
We contribute a method for approximating users’ interruptibility costs to use for experience sampling and validate the method in an application that learns when to automatically ...
Stephanie Rosenthal, Anind K. Dey, Manuela M. Velo...
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
— Due to an increasing number of sensors deployed in cars, recently there is a growing interest in implementing a wireless sensor network within a car. In this paper, we report t...
Hsin-Mu Tsai, Cem U. Saraydar, Timothy Talty, Mich...