Sciweavers

1404 search results - page 158 / 281
» On General Laws of Complex Networks
Sort
View
IPPS
2009
IEEE
15 years 11 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
FCT
2009
Springer
15 years 11 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...
DSN
2006
IEEE
15 years 10 months ago
The Startup Problem in Fault-Tolerant Time-Triggered Communication
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
Wilfried Steiner, Hermann Kopetz
GLOBECOM
2006
IEEE
15 years 10 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
P2P
2006
IEEE
15 years 10 months ago
Cost-Based Analysis of Hierarchical DHT Design
Flat DHT architectures have been the main focus of the research on DHT design so far. However, there have been also a number of works proposing hierarchical DHT organizations and ...
Stefan Zöls, Zoran Despotovic, Wolfgang Kelle...