595 search results - page 50 / 119 » The Graph Programming Language GP |
117
click to vote
ESOP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
98
Voted
VSTTE
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. This paper presents a method for deriving an expression from the lowlevel code compiled from an expression in a high-level language. The input is a low-level control flo...
144
click to vote
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
100
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
197
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...