Sciweavers

688 search results - page 69 / 138
» Types for trees
Sort
View
IPMU
1994
Springer
15 years 4 months ago
Philosophical Foundations for Causal Networks
Bayes nets are seeing increasing use in expert systems [2, 6], and structural equations models continue to be popular in many branches of the social sciences [1]. Both types of mod...
Glenn Shafer
FINTAL
2006
15 years 3 months ago
Discourse Segmentation of German Written Texts
Abstract. Discourse segmentation is the division of a text into minimal discourse segments, which form the leaves in the trees that are used to represent discourse structures. A de...
Harald Lüngen, Csilla Puskás, Maja B&a...
MPC
2000
Springer
105views Mathematics» more  MPC 2000»
15 years 3 months ago
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Sergei M. Abramov, Robert Glück
PPOPP
2012
ACM
13 years 7 months ago
PARRAY: a unifying array representation for heterogeneous parallelism
This paper introduces a programming interface called PARRAY (or Parallelizing ARRAYs) that supports system-level succinct programming for heterogeneous parallel systems like GPU c...
Yifeng Chen, Xiang Cui, Hong Mei
LICS
2008
IEEE
15 years 6 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...