Login / Signup
A semidefinite programming hierarchy for packing problems in discrete geometry.
David de Laat
Frank Vallentin
Published in:
Math. Program. (2015)
Keyphrases
</>
semidefinite programming
discrete geometry
packing problem
linear programming
interior point methods
integer programming
kernel matrix
primal dual
maximum margin
thinning algorithm
computational geometry
discrete space
special case
binary images
computer vision
input image
feature space
computational complexity