1095 search results - page 88 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
115
click to vote
ISI
2006
Springer
15 years 2 months ago
2006
Springer
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques i...
148
click to vote
DMG
2005
Springer
15 years 8 months ago
2005
Springer
Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. We are developing a data grid s...
130
click to vote
VISUALIZATION
2005
IEEE
15 years 8 months ago
2005
IEEE
Existing parallel or remote rendering solutions rely on communicating pixels, OpenGL commands, scene-graph changes or application-specific data. We propose an intermediate soluti...
128
Voted
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
103
click to vote
CIE
2010
Springer
15 years 6 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...