5606 search results - page 278 / 1122 » Randomization Techniques for Graphs. |
209
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
129
click to vote
COCO
2007
Springer
16 years 21 days ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
196
click to vote
TON
2008
15 years 6 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
151
click to vote
ISSRE
2008
IEEE
16 years 27 days ago
2008
IEEE
The usual way to compare testing strategies, whether theoretically or empirically, is to compare the number of faults they detect. To ascertain definitely that a testing strategy...
165
click to vote
CRV
2007
IEEE
16 years 26 days ago
2007
IEEE
As an extension to classical structured lighting techniques, the use of bi-dimensional pseudo-random color codes is explored to perform range sensing with variable density from a ...