2436 search results - page 228 / 488 » Comonadic Notions of Computation |
126
Voted
FOSSACS
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
162
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
157
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
161
click to vote
ICCS
2004
Springer
16 years 2 days ago
2004
Springer
The paper introduces a notion of collaborative teleradiology as a novel organisation of information exchange during a remote radiological consultation. A general interaction patter...
176
click to vote
ICCS
2004
Springer
16 years 2 days ago
2004
Springer
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...