THU, 09.07.2020, 15:30-16:30 UTC+2
Papers:
• Active Learning a Convex Body in Low Dimensions
• Polytopes, lattices, and spherical codes for the nearest neighbor problem
• On the two-dimensional knapsack problem for convex polygons
• Near-optimal Algorithm for Constructing Greedy Consensus Tree
• Computational Complexity of the α-Ham-Sandwich Problem
• Succinct Filters for Sets of Unknown Sizes