In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
Joachim Gudmundsson, Jyrki Katajainen, Damian Merr...
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
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...