Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
We present text replays, a method for generating labels that can be used to train classifiers of student behavior. We use this method to label data as to whether students are gamin...
Ryan Shaun Joazeiro de Baker, Adriana M. J. B. de ...
An image segmentation scheme that utilizes image-based flow fields in a curve evolution framework is presented. Geometric curve evolution methods require an edge function and a ve...
Baris Sumengen, B. S. Manjunath, Charles S. Kenney