21 citations · 26 across the 5 of their papers we have counts for
5 papers
Batch Active Learning via Coordinated Matching
Javad Azimi, Alan Fern, Xiaoli Zhang-Fern +2
Most prior work on active learning of classifiers has focused on sequentially selecting one unlabeled example at a time to be labeled in order to reduce the overall labeling effort…
Rigid components in fixed-lattice and cone frameworks
Matthew Berardi, Brent Heeringa, Justin Malestein +1
We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice fr…
Searching in Dynamic Tree-Like Partial Orders
Brent Heeringa, Marius Catalin Iordan, Louis Theran
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tre…
Heapable Sequences and Subsequences
John Byers, Brent Heeringa, Michael Mitzenmacher +1
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at…
The Knapsack Problem with Neighbour Constraints
Glencora Borradaile, Brent Heeringa, Gordon Wilfong
We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can…