1737 search results - page 199 / 348 » Using Strategy Objectives for Network Security Analysis |
148
click to vote
DSN
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...
171
Voted
MMMACNS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
196
click to vote
PAMI
2007
15 years 5 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
156
click to vote
DSN
2008
IEEE
16 years 21 days ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
163
click to vote
SIAMREV
2010
15 years 29 days ago
2010
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...