Sciweavers

819 search results - page 69 / 164
» Parallelization with Tree Skeletons
Sort
View
PDCAT
2007
Springer
15 years 3 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
VECPAR
2004
Springer
15 years 3 months ago
Dynamically Adaptive Binomial Trees for Broadcasting in Heterogeneous Networks of Workstations
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
Silvia M. Figueira, Christine Mendes
FPL
2009
Springer
99views Hardware» more  FPL 2009»
15 years 2 months ago
Exploiting fast carry-chains of FPGAs for designing compressor trees
Fast carry chains featuring dedicated adder circuitry is a distinctive feature of modern FPGAs. The carry chains bypass the general routing network and are embedded in the logic b...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
ECCV
2008
Springer
15 years 11 months ago
Implementing Decision Trees and Forests on a GPU
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
Toby Sharp
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
15 years 4 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar