Sciweavers

1095 search results - page 124 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
125
Voted
CGF
2008
144views more  CGF 2008»
15 years 2 months ago
High Performance GPU-based Proximity Queries using Distance Fields
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...
T. Morvan, M. Reimers, E. Samset
ICDCS
2007
IEEE
15 years 9 months ago
Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks
While extensive studies have been carried out in the past several years for many sensor applications, they cannot be applied to the network with extremely low and intermittent con...
Yu Wang, Hongyi Wu, Feng Lin, Nian-Feng Tzeng
135
Voted
SPAA
2005
ACM
15 years 8 months ago
Finding effective support-tree preconditioners
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ra...
HPDC
2005
IEEE
15 years 8 months ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...
128
Voted
SPAA
2005
ACM
15 years 8 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev