Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...