2137 search results - page 144 / 428 » Proving Abstract Non-interference |
110
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
122
click to vote
COMPSEC
2010
15 years 1 months ago
2010
Abstract A Secret Handshake is a protocol that allows two users to mutually verify one another’s properties, and in case of simultaneous matching, to share a key used to secure s...
108
click to vote
JCSS
2010
15 years 1 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
119
click to vote
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
142
click to vote
MSCS
2010
15 years 1 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...