3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.OC2016
Symmetry-free SDP Relaxations for Affine Subspace Clustering
Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr
We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While ther…
cs.DS2014★ 3 cited
Network-Oblivious Algorithms
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci +2
A framework is proposed for the design and analysis of \emph{network-oblivious algorithms}, namely, algorithms that can run unchanged, yet efficiently, on a variety of machines cha…