Talks
14 Lectures · Aug 1, 2007
About
Description is not available
Related categories
Uploaded videos:
27:48
An Efficient Sampling Scheme For Comparison of Large Graphs
Sep 05, 2007
·
3821 Views
26:25
Efficient Closed Pattern Mining in Strongly Accessible Set Systems
Sep 04, 2007
·
3436 Views
21:48
A Universal Kernel for Learning Regular Languages
Sep 05, 2007
·
4321 Views
23:16
DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs
Sep 05, 2007
·
2943 Views
20:49
Speeding up Graph Edit Distance Computation with a Bipartite Heuristic
Sep 05, 2007
·
3845 Views
17:10
The Cost of Learning Directed Cuts
Sep 05, 2007
·
3040 Views
27:03
Support Computation for Mining Frequent Subgraphs in a Single Graph
Sep 05, 2007
·
3403 Views
25:38
Inferring vertex properties from topology in large networks
Sep 05, 2007
·
3339 Views
20:33
A Polynomial-time Metric for Outerplanar Graphs (Extended Abstract)
Sep 05, 2007
·
2993 Views
22:45
Improving frequent subgraph mining in the presence of symmetry
Sep 05, 2007
·
3285 Views
27:48
General Graph Refinement with Polynomial Delay
Sep 05, 2007
·
3276 Views
23:34
Weighted Substructure Mining for Image Analysis
Sep 05, 2007
·
2765 Views
17:54
Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning
Sep 05, 2007
·
2929 Views
17:11
Fast Inference in Infinite Hidden Relational Models
Sep 05, 2007
·
4842 Views