Sciweavers

2436 search results - page 289 / 488
» Comonadic Notions of Computation
Sort
View
MOBIHOC
2003
ACM
16 years 6 months ago
ESRT: event-to-sink reliable transport in wireless sensor networks
Wireless sensor networks (WSN) are event based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective...
Yogesh Sankarasubramaniam, Özgür B. Akan...
PLDI
2009
ACM
16 years 1 months ago
A weakest precondition approach to active attacks analysis
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...
Musard Balliu, Isabella Mastroeni
SSD
2009
Springer
149views Database» more  SSD 2009»
16 years 1 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 24 days ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
ASIACRYPT
2007
Springer
16 years 24 days ago
Bounded CCA2-Secure Encryption
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, ...