no code implementations • NeurIPS 2016 • Nils M. Kriege, Pierre-Louis Giscard, Richard C. Wilson
The success of kernel methods has initiated the design of novel positive semidefinite functions, in particular for structured data.
Ranked #2 on Graph Classification on NCI109
no code implementations • 29 Jan 2019 • Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson
In this paper, we develop an algorithm which can find an optimal assignment in linear time when the cost function between objects is represented by a tree distance.
1 code implementation • 16 Dec 2016 • Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson
These comparisons show that the algorithm described here is the best general purpose algorithm for the class of graphs where $(\ell^{\omega-1}\Delta^{-1}+1) |S_\ell|\leq |\text{Cycle}_\ell|$, with $|\text{Cycle}_\ell|$ the total number of simple cycles of length at most $\ell$, including backtracks and self-loops.
Data Structures and Algorithms Discrete Mathematics Combinatorics 68Q25, 68W40, 05C30, 05C38, 05C22