Sciweavers

806 search results - page 81 / 162
» Lower Bounds on Correction Networks
Sort
View
ACSAC
2010
IEEE
14 years 9 months ago
A quantitative analysis of the insecurity of embedded network devices: results of a wide-area scan
We present a quantitative lower bound on the number of vulnerable embedded device on a global scale. Over the past year, we have systematically scanned large portions of the inter...
Ang Cui, Salvatore J. Stolfo
OPODIS
2007
15 years 7 months ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
ICDCN
2009
Springer
16 years 24 days ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
15 years 6 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
IM
2007
15 years 7 months ago
CLID: A general approach to validate security policies in a dynamic network
- Many researchers have considered security policy management, including how to configure policies manually and even how to automatically generate security policies based on securi...
Yanyan Yang, Charles U. Martel, Shyhtsun Felix Wu