Sciweavers

1503 search results - page 247 / 301
» Detecting Anomalies in Graphs
Sort
View
TIT
2008
122views more  TIT 2008»
14 years 10 months ago
Identifying Codes and Covering Problems
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...
Moshe Laifenfeld, Ari Trachtenberg
OOPSLA
2010
Springer
14 years 8 months ago
Parallel inclusion-based points-to analysis
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...
Mario Méndez-Lojo, Augustine Mathew, Keshav...
SADM
2010
123views more  SADM 2010»
14 years 8 months ago
Discriminative frequent subgraph mining with optimality guarantees
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...
ICIP
2010
IEEE
14 years 8 months ago
Robust segmentation of lung tissue in chest CT scanning
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...
Amal A. Farag, James Graham, Aly Farag
ICASSP
2010
IEEE
14 years 7 months ago
Mining actor correlations with hierarchical concurrence parsing
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...
Kun Yuan, Hongxun Yao, Rongrong Ji, Xiaoshuai Sun