6105 search results - page 57 / 1221 » A Parallel Algorithm for Bound-Smoothing |
JCC
2010
15 years 25 days ago
2010
Abstract: Modern graphics processing units (GPUs) are flexibly programmable and have peak computational throughput significantly faster than conventional CPUs. Herein, we describ...
116
Voted
SPIRE
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
124
click to vote
TVCG
2010
15 years 22 days ago
2010
—We present a scheme for view-dependent level-of-detail control that is implemented entirely on programmable graphics hardware. Our scheme selectively refines and coarsens an ar...
125
click to vote
IEEECIT
2010
IEEE
15 years 27 days ago
2010
IEEE
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...
79
Voted
COCO
1989
Springer
15 years 6 months ago
1989
Springer
