1095 search results - page 63 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
120
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
142
Voted
EGH
2010
Springer
15 years 13 days ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
107
click to vote
MICRO
2008
IEEE
15 years 8 months ago
2008
IEEE
The advent of multicores presents a promising opportunity for speeding up sequential programs via profile-based speculative parallelization of these programs. In this paper we pr...
131
Voted
SC
2003
ACM
15 years 7 months ago
2003
ACM
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
140
Voted
WIMOB
2008
IEEE
15 years 8 months ago
2008
IEEE
Energy is a central concern in the deployment of wireless sensor networks. In this paper, we investigate the energy cost of cryptographic protocols, both from a communication and ...