Sciweavers

19700 search results - page 3594 / 3940
» DNA-Based Computation Times
Sort
View
CONCUR
2010
Springer
15 years 8 months ago
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
CONEXT
2009
ACM
15 years 8 months ago
Virtually eliminating router bugs
Software bugs in routers lead to network outages, security vulnerabilities, and other unexpected behavior. Rather than simply crashing the router, bugs can violate protocol semant...
Eric Keller, Minlan Yu, Matthew Caesar, Jennifer R...
DEBS
2008
ACM
15 years 8 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
DEBS
2009
ACM
15 years 8 months ago
Towards efficient event aggregation in a decentralized publish-subscribe system
Recently, decentralized publish-subscribe (pub-sub) systems have gained popularity as a scalable asynchronous messaging paradigm over wide-area networks. Most existing pub-sub sys...
Jianxia Chen, Lakshmish Ramaswamy, David Lowenthal
« Prev « First page 3594 / 3940 Last » Next »