1237 search results - page 45 / 248 » Abstract shade trees |
146
click to vote
WOLLIC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
135
click to vote
WDAG
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
146
click to vote
ASIAN
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...
141
click to vote
CSR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
143
click to vote
PVM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...