Thomas Laurent

most citedConvergence of a Steepest Descent Algorithm for Ratio Cut Clustering

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.OC2012★ 2 cited

Convergence of a Steepest Descent Algorithm for Ratio Cut Clustering

Xavier Bresson, Thomas Laurent, David Uminsky +1

Unsupervised clustering of scattered, noisy and high-dimensional data points is an important and difficult problem. Tight continuous relaxations of balanced cut problems have recen…

math.AP2012

Characterization of radially symmetric finite time blowup in multidimensional aggregation equations,

Andrea L. Bertozzi, John B. Garnett, Thomas Laurent

This paper studies the transport of a mass $μ$ in $ℜ^{d}, d \geq 2,$ by a flow field $v = - \nabla K * μ$ . We focus on kernels $K = ∣ x ∣^{α} / α$ for $2 - d \leq α < 2$ for which the smooth den…