Sciweavers

8768 search results - page 331 / 1754
» Generalizing the notion of support
Sort
View
JAIR
2000
100views more  JAIR 2000»
15 years 7 months ago
On the Compilability and Expressive Power of Propositional Planning Formalisms
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power&qu...
Bernhard Nebel
ICITS
2009
15 years 5 months ago
Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
Peter Gazi, Ueli Maurer
IACR
2011
88views more  IACR 2011»
14 years 7 months ago
Targeted Malleability: Homomorphic Encryption for Restricted Computations
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
Dan Boneh, Gil Segev, Brent Waters
JMLR
2012
13 years 10 months ago
Algorithms for Learning Kernels Based on Centered Alignment
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh
ESORICS
2002
Springer
16 years 7 months ago
Confidentiality-Preserving Refinement is Compositional - Sometimes
Confidentiality-preserving refinement describes a relation between a specification and an implementation that ensures that all confidentiality properties required in the specificat...
Thomas Santen, Maritta Heisel, Andreas Pfitzmann