Contact interval between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs), which is important to routing schemes and network capacity. In this work,...
Yong Li, Depeng Jin, Pan Hui, Li Su, Lieguang Zeng
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...