819 search results - page 107 / 164 » Parallelization with Tree Skeletons |
TOG
2008
14 years 9 months ago
2008
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
155
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
107
click to vote
PPOPP
2003
ACM
15 years 3 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
HPCA
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...