2436 search results - page 174 / 488 » Comonadic Notions of Computation |
132
click to vote
HOA
1993
15 years 8 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
161
click to vote
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
Current scientific workflow models require datasets to be transferred from their source to the hosts where they can be processed. This seriously impedes data-intensive application...
130
click to vote
COMPLEX
2009
Springer
15 years 8 months ago
2009
Springer
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...
147
click to vote
ECCV
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we propose a novel approach for the spatial segmentation of video sequences containing multiple temporal textures. This work is based on the notion that a single tem...
156
click to vote
IFIPTCS
2000
15 years 8 months ago
2000
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...