Sciweavers

2427 search results - page 440 / 486
» Survivability Computation of Networked Information Systems
Sort
View
WWW
2011
ACM
14 years 9 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
ICN
2009
Springer
15 years 8 months ago
Measuring Route Diversity in the Internet from Remote Vantage Points
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...
Andrea Di Menna, Tiziana Refice, Luca Cittadini, G...
INFOCOM
2007
IEEE
15 years 8 months ago
Mobility Reduces Uncertainty in MANETs
Abstract— Evaluating and quantifying trust stimulates collaboration in mobile ad hoc networks (MANETs). Many existing reputation systems sharply divide the trust value into right...
Feng Li, Jie Wu
POLICY
2004
Springer
15 years 7 months ago
Responding to Policies at Runtime in TrustBuilder
Automated trust negotiation is the process of establishing trust between entities with no prior relationship through the iterative disclosure of digital credentials. One approach ...
Bryan Smith, Kent E. Seamons, Michael D. Jones
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 6 months ago
The Kalman like particle filter: Optimal estimation with quantized innovations/measurements
— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...
Ravi Teja Sukhavasi, Babak Hassibi