Sciweavers

61 search results - page 6 / 13
» Generalization of specialized on-the-fly composition
Sort
View
IWPEC
2010
Springer
14 years 9 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
13 years 1 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
PLDI
2005
ACM
15 years 4 months ago
Composing security policies with polymer
We introduce a language and system that supports definition and composition of complex run-time security policies for Java applications. Our policies are comprised of two sorts o...
Lujo Bauer, Jay Ligatti, David Walker
ICDE
2009
IEEE
409views Database» more  ICDE 2009»
16 years 11 months ago
Chameleon: Context Awareness inside DBMSs
Context is any information used to characterize the situation of an entity. Examples of contexts includetime, location, identity, and activity of a user. This paper proposes a gene...
Hicham G. Elmongui, Walid G. Aref, Mohamed F. Mokb...
ICFP
2002
ACM
15 years 11 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani