Aug 1, 2007 
14 videos 
Talks
Description is not available
23:16
DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs
Sep 5, 2007 2956 views
27:48
An Efficient Sampling Scheme For Comparison of Large Graphs
Sep 5, 2007 3843 views
22:45
Improving frequent subgraph mining in the presence of symmetry
Sep 5, 2007 3312 views
27:48
General Graph Refinement with Polynomial Delay
Sep 5, 2007 3299 views
27:03
Support Computation for Mining Frequent Subgraphs in a Single Graph
Sep 5, 2007 3427 views
17:11
Fast Inference in Infinite Hidden Relational Models
Sep 5, 2007 4866 views
20:33
A Polynomial-time Metric for Outerplanar Graphs (Extended Abstract)
Sep 5, 2007 3007 views
17:10
The Cost of Learning Directed Cuts
Sep 5, 2007 3071 views
17:54
Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning
Sep 5, 2007 2947 views
21:48
A Universal Kernel for Learning Regular Languages
Sep 5, 2007 4343 views
23:34
Weighted Substructure Mining for Image Analysis
Sep 5, 2007 2790 views
25:38
Inferring vertex properties from topology in large networks
Sep 5, 2007 3354 views
20:49
Speeding up Graph Edit Distance Computation with a Bipartite Heuristic
Sep 5, 2007 3880 views
26:25
Efficient Closed Pattern Mining in Strongly Accessible Set Systems
Sep 4, 2007 3462 views