A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Mi...
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...