Login / Signup
On the computational complexity of finding a sparse Wasserstein barycenter.
Steffen Borgwardt
Stephan Patterson
Published in:
J. Comb. Optim. (2021)
Keyphrases
</>
computational complexity
high dimensional
high computational complexity
sparse data
special case
computational cost
np complete
genetic algorithm
rate distortion
data sets
multiscale
face recognition
information systems
real time
dimensionality reduction
computationally efficient
pointwise
databases