Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
This paper presents how ad-hoc co-located collaborations can be supported with an arbitrary number of users that only have acces to small-size mobile displays. Our approach is bas...
The number of web pages available on Internet increases day after day, and consequently finding relevant information becomes more and more a hard task. However, when we consider ...
Aliaksandr Birukou, Enrico Blanzieri, Paolo Giorgi...
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...