Sciweavers

1503 search results - page 214 / 301
» Detecting Anomalies in Graphs
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 2 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
KDD
2010
ACM
240views Data Mining» more  KDD 2010»
15 years 2 months ago
Diagnosing memory leaks using graph mining on heap dumps
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
INFOCOM
2010
IEEE
14 years 8 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
DBSEC
2010
196views Database» more  DBSEC 2010»
14 years 6 months ago
Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
Abstract. This paper describes how to preserve integrity and confidentiality of a directed acyclic graph (DAG) model of provenance database. We show a method to preserve integrity ...
Amril Syalim, Takashi Nishide, Kouichi Sakurai
VLDB
2005
ACM
177views Database» more  VLDB 2005»
15 years 3 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins