From 20072fdb61715b49c769a32cd3c827ebb0f90dc6 Mon Sep 17 00:00:00 2001 From: Dimitri Lozeve Date: Sun, 30 Aug 2020 23:09:16 +0200 Subject: [PATCH] Switch to MathJax for maths rendering --- ...al-transport-for-document-classification.org | 2 +- templates/default.html | 17 +++-------------- 2 files changed, 4 insertions(+), 15 deletions(-) diff --git a/posts/hierarchical-optimal-transport-for-document-classification.org b/posts/hierarchical-optimal-transport-for-document-classification.org index 92f3211..b0eac1e 100644 --- a/posts/hierarchical-optimal-transport-for-document-classification.org +++ b/posts/hierarchical-optimal-transport-for-document-classification.org @@ -77,7 +77,7 @@ More formally, we start with two sets of points $x = (x_1, x_2, \ldots, W_1(p, q) = \min_{P \in \mathbb{R}_+^{n\times m}} \sum_{i,j} C_{i,j} P_{i,j} \] \[ -\text{\small subject to } \sum_j P_{i,j} = p_i \text{ \small and } \sum_i P_{i,j} = q_j, +\text{subject to } \sum_j P_{i,j} = p_i \text{ and } \sum_i P_{i,j} = q_j, \] where $C_{i,j} = d(x_i, x_j)$ are the costs computed from the original distance between points, and $P_{i,j}$ represent the amount we are moving from pile $i$ to pile $j$. diff --git a/templates/default.html b/templates/default.html index b53a018..cee13ab 100644 --- a/templates/default.html +++ b/templates/default.html @@ -17,20 +17,9 @@ - - - - - - - - - - - - - + + +