Sciweavers

7690 search results - page 1472 / 1538
» On the semantics of informational independence
Sort
View
ASPLOS
2008
ACM
15 years 4 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
ATAL
2006
Springer
15 years 3 months ago
SAgent: a security framework for JADE
This paper presents SAgent, a general-purpose mobile agent security framework that is designed to protect the computations of mobile agent applications in potentially hostile envi...
Vandana Gunupudi, Stephen R. Tate
CANDC
2005
ACM
15 years 3 months ago
Freedom and constraint in the creative process in digital fine art: an AHRB invited workshop
The workshop will explore in depth the nature of freedom and constraint in the creative process in digital fine art from the perspective of embodied mind. The problem is crucial t...
John Haworth, Sue Gollifer, James Faure Walker, Pa...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 3 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 3 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
« Prev « First page 1472 / 1538 Last » Next »