819 search results - page 150 / 164 » Parallelization with Tree Skeletons |
SODA
1996
ACM
13 years 9 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
SODA
1990
ACM
13 years 9 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
DAGM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
GD
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...