Picture for Marco Saerens

Marco Saerens

Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison

Add code
Aug 23, 2021
Figure 1 for Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
Figure 2 for Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
Figure 3 for Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
Figure 4 for Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
Viaarxiv icon

Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization

Add code
Jul 01, 2020
Figure 1 for Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
Figure 2 for Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
Figure 3 for Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
Figure 4 for Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
Viaarxiv icon

Randomized Shortest Paths with Net Flows and Capacity Constraints

Add code
Oct 04, 2019
Figure 1 for Randomized Shortest Paths with Net Flows and Capacity Constraints
Figure 2 for Randomized Shortest Paths with Net Flows and Capacity Constraints
Figure 3 for Randomized Shortest Paths with Net Flows and Capacity Constraints
Figure 4 for Randomized Shortest Paths with Net Flows and Capacity Constraints
Viaarxiv icon

Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism

Add code
Feb 08, 2019
Figure 1 for Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism
Figure 2 for Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism
Figure 3 for Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism
Figure 4 for Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism
Viaarxiv icon

A Constrained Randomized Shortest-Paths Framework for Optimal Exploration

Add code
Jul 12, 2018
Figure 1 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Figure 2 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Figure 3 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Figure 4 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Viaarxiv icon

Randomized Optimal Transport on a Graph: Framework and New Distance Measures

Add code
Jun 07, 2018
Figure 1 for Randomized Optimal Transport on a Graph: Framework and New Distance Measures
Figure 2 for Randomized Optimal Transport on a Graph: Framework and New Distance Measures
Viaarxiv icon

An experimental study of graph-based semi-supervised classification with additional node information

Add code
May 24, 2017
Figure 1 for An experimental study of graph-based semi-supervised classification with additional node information
Figure 2 for An experimental study of graph-based semi-supervised classification with additional node information
Figure 3 for An experimental study of graph-based semi-supervised classification with additional node information
Figure 4 for An experimental study of graph-based semi-supervised classification with additional node information
Viaarxiv icon

A bag-of-paths framework for network data analysis

Add code
Dec 14, 2016
Figure 1 for A bag-of-paths framework for network data analysis
Figure 2 for A bag-of-paths framework for network data analysis
Figure 3 for A bag-of-paths framework for network data analysis
Figure 4 for A bag-of-paths framework for network data analysis
Viaarxiv icon

Developments in the theory of randomized shortest paths with a comparison of graph node distances

Add code
Oct 03, 2013
Figure 1 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Figure 2 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Figure 3 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Figure 4 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Viaarxiv icon

The Sum-over-Forests density index: identifying dense regions in a graph

Add code
Jan 04, 2013
Figure 1 for The Sum-over-Forests density index: identifying dense regions in a graph
Figure 2 for The Sum-over-Forests density index: identifying dense regions in a graph
Figure 3 for The Sum-over-Forests density index: identifying dense regions in a graph
Figure 4 for The Sum-over-Forests density index: identifying dense regions in a graph
Viaarxiv icon