Sciweavers

43 search results - page 8 / 9
» Percolation in the Secrecy Graph
Sort
View
IPSN
2004
Springer
14 years 13 days ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
COCOON
2008
Springer
13 years 8 months ago
Visual Cryptography on Graphs
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
Steve Lu, Daniel Manchala, Rafail Ostrovsky
CDC
2008
IEEE
116views Control Systems» more  CDC 2008»
14 years 1 months ago
Effective sensing regions and connectivity of agents undergoing periodic relative motions
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
Daniel T. Swain, Ming Cao, Naomi Ehrich Leonard
DIS
2009
Springer
13 years 11 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
ACSAC
2005
IEEE
14 years 21 days ago
Code Security Analysis of a Biometric Authentication System Using Automated Theorem Provers
Understanding the security goals provided by cryptographic protocol implementations is known to be difficult, since security requirements such as secrecy, integrity and authentici...
Jan Jürjens