2436 search results - page 108 / 488 » Comonadic Notions of Computation |
156
click to vote
ESOP
2005
Springer
15 years 9 months ago
2005
Springer
The notion of control dependence underlies many program analysis and transformation techniques used in numerous applications. Despite wide application, existing definitions and ap...
117
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
131
click to vote
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
137
click to vote
APAL
2007
15 years 4 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
128
Voted
JAIR
2008
15 years 4 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...