Talks

Talks

14 Lectures · Aug 1, 2007

Uploaded videos:

video-img
27:48

An Efficient Sampling Scheme For Comparison of Large Graphs

Karsten Michael Borgwardt

Sep 05, 2007

 · 

3821 Views

Lecture
video-img
26:25

Efficient Closed Pattern Mining in Strongly Accessible Set Systems

Tamás Horváth

Sep 04, 2007

 · 

3436 Views

Lecture
video-img
21:48

A Universal Kernel for Learning Regular Languages

Leonid Kontorovich

Sep 05, 2007

 · 

4321 Views

Lecture
video-img
23:16

DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs

Alexandre Termier

Sep 05, 2007

 · 

2943 Views

Lecture
video-img
20:49

Speeding up Graph Edit Distance Computation with a Bipartite Heuristic

Kaspar Riesen

Sep 05, 2007

 · 

3846 Views

Lecture
video-img
27:03

Support Computation for Mining Frequent Subgraphs in a Single Graph

Mathias Fiedler

Sep 05, 2007

 · 

3404 Views

Lecture
video-img
25:38

Inferring vertex properties from topology in large networks

Janne Aukia

Sep 05, 2007

 · 

3339 Views

Lecture
video-img
20:33

A Polynomial-time Metric for Outerplanar Graphs (Extended Abstract)

Leander Schietgat

Sep 05, 2007

 · 

2993 Views

Lecture
video-img
22:45

Improving frequent subgraph mining in the presence of symmetry

Christian Desrosiers

Sep 05, 2007

 · 

3285 Views

Lecture
video-img
27:48

General Graph Refinement with Polynomial Delay

Jan Ramon

Sep 05, 2007

 · 

3277 Views

Lecture
video-img
23:34

Weighted Substructure Mining for Image Analysis

Sebastian Nowozin

Sep 05, 2007

 · 

2765 Views

Lecture
video-img
17:54

Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning

Jose Santos

Sep 05, 2007

 · 

2929 Views

Lecture
video-img
17:11

Fast Inference in Infinite Hidden Relational Models

Zhao Xu

Sep 05, 2007

 · 

4843 Views

Lecture
video-img
17:10

The Cost of Learning Directed Cuts

Thomas Gartner

Sep 05, 2007

 · 

3042 Views

Lecture