1493 search results - page 48 / 299 » Local resilience of graphs |
IM
2003
13 years 9 months ago
2003
Abstract: A probabilistic event-driven fault localization technique is presented, which uses a symptom-fault map as a fault propagation model. The technique isolates the most proba...
JNW
2006
13 years 7 months ago
2006
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
HICSS
2007
IEEE
14 years 2 months ago
2007
IEEE
Studies of worm outbreaks have found that the speed of worm propagation makes manual intervention ineffective. Consequently, many automated containment mechanisms have been propos...