8 citations · 34 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CG2019★ 6 cited
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Rahul Arya, Sunil Arya, Guilherme D. da Fonseca +1
This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body of unit diameter in Euclidean -dimension…
cs.CG2019
Guarantees on Nearest-Neighbor Condensation heuristics
Alejandro Flores-Velazco, David Mount
The problem of nearest-neighbor (NN) condensation aims to reduce the size of a training set of a nearest-neighbor classifier while maintaining its classification accuracy. Although…