The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
The increasing availability of large-scale location traces creates unprecedent opportunities to change the paradigm for identifying abnormal moving activities. Indeed, various asp...
Yong Ge, Hui Xiong, Zhi-hua Zhou, Hasan Ozdemir, J...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
Scientists depend on literature search to find prior work that is relevant to their research ideas. We introduce a retrieval model for literature search that incorporates a wide ...