1419 search results - page 157 / 284 » A Characterization of Constructive Dimension |
150
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
165
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
160
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
141
click to vote
ICPR
2008
IEEE
16 years 28 days ago
2008
IEEE
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
200
click to vote
QEST
2007
IEEE
16 years 23 days ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...