Sciweavers

5484 search results - page 1077 / 1097
» Almost-Everywhere Secure Computation
Sort
View
LICS
2006
IEEE
15 years 5 months ago
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. ...
SRDS
2006
IEEE
15 years 5 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
ASPLOS
2006
ACM
15 years 5 months ago
Introspective 3D chips
While the number of transistors on a chip increases exponentially over time, the productivity that can be realized from these systems has not kept pace. To deal with the complexit...
Shashidhar Mysore, Banit Agrawal, Navin Srivastava...
IMC
2006
ACM
15 years 5 months ago
A study of malware in peer-to-peer networks
Peer-to-peer (P2P) networks continue to be popular means of trading content. However, very little protection is in place to make sure that the files exchanged in these networks a...
Andrew J. Kalafut, Abhinav Acharya, Minaxi Gupta
IMC
2006
ACM
15 years 5 months ago
Unexpected means of protocol inference
Network managers are inevitably called upon to associate network traffic with particular applications. Indeed, this operation is critical for a wide range of management functions...
Justin Ma, Kirill Levchenko, Christian Kreibich, S...
« Prev « First page 1077 / 1097 Last » Next »