Computer Science Colloquium, 2006-2007

Danny Keren
March 21, 2007

Title: Geometric Monitoring


In communication-efficient distributed monitoring, an important problem is to determine -- with a minimal number of transmissions -- whether the value of a certain function, evaluated at a global data vector, has exceeded a certain threshold. We suggest a solution based on geometry. The convex hull of the local data vectors is covered by a union of local sets, and each node tests its own set. This results in a very substantial reduction in communication.

Joint work with Prof. Assaf Schuster and Tsachi Sharfman, the Technion.
A paper describing the method can be downloaded from

Benny Pinkas