LexBFS-Minimal VertexSeparators Final Presentation
CMU SCS I2.2 Large Scale Information Network Processing INARC 1 Overview Goal: scalable algorithms to find patterns and anomalies on graphs 1. Mining Large.
De-anonymizing social networks Arvind Narayanan, Vitaly Shmatikov.
Simulated Annealing in 512 bytes EMICRO2004 Microelectronics School Marcelo Johann B R A Z I L.
Mesh Layouts for Block-Based Caches Sung-Eui Yoon Peter Lindstrom Lawrence Livermore National Laboratory.
Graph Modeled Data Clustering: Fixed Parameter Algorithms for Clique Generation J. Gramm, J. Guo, F. Hüffner and R. Niedermeier Theory of Computing Systems.
GUI implementation for Supervised and Unsupervised SUBDUE System.
GReAT: Graph Rewriting And Transformation Presenter: Yuehua Lin 2/17/04, Tuesday Slides help from Aditya Agrawal [email protected].
Link Reversal Algorithms Jennifer L. Welch DISC 2014 Tutorial.
Parameterized Algorithms Advanced Kernelization Techniques
Approximation and Hardness Results for Packing Cycles Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint work with M.
DISCOVERING LARGER NETWORK MOTIFS Li Chen 4/16/2009 CSC 8910 Analysis of Biological Network, Spring 2009 Dr. Yi Pan.