2137 search results - page 246 / 428 » Proving Abstract Non-interference |
123
click to vote
FUIN
2002
15 years 3 months ago
2002
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
138
Voted
INFORMATICALT
1998
15 years 3 months ago
1998
Abstract. In the previous papers (Masreliez and Martin, 1977; Novoviˇcova, 1987; Schick and Mitter, 1994) the problem of recursive estimation of linear dynamic systems parameters ...
128
click to vote
JSYML
2002
15 years 3 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
153
click to vote
JGAA
1998
15 years 3 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
MOC
2002
15 years 3 months ago
2002
Abstract. We analyze the approximation and smoothness properties of quincunx fundamental refinable functions. In particular, we provide a general way for the construction of quincu...