7259 search results - page 97 / 1452 » From Fields to Trees |
ALGORITHMICA
2008
13 years 8 months ago
2008
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 ...
EJC
2010
13 years 8 months ago
2010
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 ...
TCS
2008
13 years 8 months ago
2008
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...
EDM
2008
13 years 9 months ago
2008
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...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
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...