8 citations · 9 across the 2 of their papers we have counts for
6 papers · 1 filter
Approximate Nearest-Neighbor Search for Line Segments
Ahmed Abdelkader, David M. Mount
Approximate nearest-neighbor search is a fundamental algorithmic problem that continues to inspire study due its essential role in numerous contexts. In contrast to most prior work…
Coresets for the Nearest-Neighbor Rule
Alejandro Flores-Velazco, David M. Mount
Given a training set of labeled points, the nearest-neighbor rule predicts the class of an unlabeled query point as the label of its closest point in the set. To improve the ti…
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…
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums
Sunil Arya, Guilherme D. da Fonseca, David M. Mount
Approximation problems involving a single convex body in -dimensional space have received a great deal of attention in the computational geometry community. In contrast, works i…
Near-Optimal -Kernel Construction and Related Problems
Sunil Arya, Guilherme D. da Fonseca, David M. Mount
The computation of (i) -kernels, (ii) approximate diameter, and (iii) approximate bichromatic closest pair are fundamental problems in geometric approximation. In this…
On the Complexity of an Unregulated Traffic Crossing
Philip Dasler, David M. Mount
The steady development of motor vehicle technology will enable cars of the near future to assume an ever increasing role in the decision making and control of the vehicle itself. I…