Sciweavers

867 search results - page 110 / 174
» Network Robustness and Graph Topology
Sort
View
ACSAC
2004
IEEE
13 years 11 months ago
PEACE: A Policy-Based Establishment of Ad-hoc Communities
Ad-hoc networks are perceived as communities of autonomous devices that interconnect with each other. Typically, they have dynamic topologies and cannot rely on a continuous conne...
Sye Loong Keoh, Emil Lupu, Morris Sloman
PODC
1990
ACM
13 years 12 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 8 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
PADS
2005
ACM
14 years 1 months ago
Software Diversity as a Defense against Viral Propagation: Models and Simulations
The use of software diversity has often been discussed in the research literature as an effective means to break up the software monoculture present on the Internet and to thus p...
Adam J. O'Donnell, Harish Sethu
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 6 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie