2924 search results - page 258 / 585 » Lower Bounds in Distributed Computing |
133
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
132
click to vote
AINA
2008
IEEE
15 years 10 months ago
2008
IEEE
An experimental study shows the feasibility of service-oriented architectures for industrial automation and control systems even with respect to lower, real-time dependent control...
125
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper describes results concerning the robustness and generalization capabilities of kernel methods in detecting coordinated distributed multiple attacks (CDMA) using network...
134
click to vote
CLUSTER
2006
IEEE
15 years 7 months ago
2006
IEEE
Effective overlap of computation and communication is a well understood technique for latency hiding and can yield significant performance gains for applications on high-end compu...
124
Voted
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...