This paper is concerned with pool-based active learning for deep neural networks. Motivated by coreset dataset compression ideas, we present a novel active learning algorithm that queries consecutive points from the pool using farthest-first traversals in the space of neural activation over a representation layer. We show consistent and overwhelming improvement in sample complexity over passive...

We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n1/2 log n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher d...

An earlier result states that, on the surface of a convex polyhedron with vertices endowed with its intrinsic metric, a point cannot have more than antipodes (farthest points). In this paper we produce examples of polyhedra with vertices, on which some suitable point admits exactly antipodes. We also proved that, for any positive number 1, there exist (in the closure of the set of these polyhed...

We consider the problem of computing all farthest neighbors (and the diameter) of a given set of n points in the presence of highways and obstacles in the plane. When traveling on the plane, travelers may use highways for faster movement and must avoid all obstacles. We present an efficient solution to this problem based on knowledge from earlier research on shortest path computation. Our algor...

We propose a real-time fingertip detection algorithm based on depth information. It can robustly detect single fingertip regardless of the position and direction of the hand. With the depth information of front view, depth map of top view and side view is generated. Due to the difference between finger thickness and fist thickness, we use thickness histogram to segment the finger from the fist....

A minimax two-facility location problem in multidimensional space with Chebyshev metric is examined subject to box constraints on the feasible area. In problem, there are two groups of points known coordinates, and one needs find coordinates for optimal new under given constraints. The considered if it minimizes maximum following values: distance between first point farthest group, second point...

Graph burning is a process to determine the spreading of information in graph. If sequence vertices burns all graph by following process, then such known as sequence. The problem consists finding minimum length for given solution this NP-hard combinatorial optimization helps quantify graph’s vulnerability contagion. This paper introduces simple farthest-first traversal-based approximatio...