Sciweavers

2436 search results - page 214 / 488
» Comonadic Notions of Computation
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Fault and adversary tolerance as an emergent property of distributed systems' software architectures
Fault and adversary tolerance have become not only desirable but required properties of software systems because mission-critical systems are commonly distributed on large network...
Yuriy Brun, Nenad Medvidovic
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
16 years 7 months ago
Non-malleable Obfuscation
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
Ran Canetti, Mayank Varia
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
16 years 6 months ago
Privacy Preserving OLAP
We present techniques for privacy-preserving computation of multidimensional aggregates on data partitioned across multiple clients. Data from different clients is perturbed (rand...
Rakesh Agrawal, Ramakrishnan Srikant, Dilys Thomas
ICFP
2004
ACM
16 years 6 months ago
Numbering matters: first-order canonical forms for second-order recursive types
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
François Pottier, Nadji Gauthier
EWSN
2006
Springer
16 years 6 months ago
Sensor Density for Complete Information Coverage in Wireless Sensor Networks
Abstract. Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...