The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
Marisa Thoma, Hong Cheng, Arthur Gretton, Jiawei H...
This paper deals with segmentation of the lung tissues from low dose CT (LDCT) scans of the chest. Goal is correct segmentation as well as maintaining the details of the lung regi...
Mining actor correlations from TV series enables semanticlevel video understanding and facilitates users to conduct correlation-based query. In this paper, we introduce a graphbas...