1019 search results - page 27 / 204 » Uniform Functors on Sets |
CALCO
2009
Springer
14 years 2 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
: Many high performance computing algorithms are bandwidth limited, hence the need for optimal data rearrangement kernels as well as their easy integration into the rest of the app...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
ENTCS
2006
13 years 7 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...