858 search results - page 154 / 172 » CX: A scalable, robust network for parallel computing |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
101
click to vote
WOMPAT
2001
Springer
15 years 4 months ago
2001
Springer
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although cl...
ICISC
2004
15 years 1 months ago
2004
Abstract. The proliferation of group-centric computing and communication motivates the need for mechanisms to provide group access control. Group access control includes mechanisms...
ICPADS
2006
IEEE
15 years 5 months ago
2006
IEEE
Several IP Traceback schemes employing packet marking have been proposed to trace DoS/DDoS attacks that use source address spoofing. The major challenges in the design of an ef...
101
click to vote
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...