1002 search results - page 36 / 201 » Towards Graph Programs for Graph Algorithms |
119
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
126
click to vote
LCPC
2005
Springer
15 years 7 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
125
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
127
Voted
PLDI
1993
ACM
15 years 6 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
143
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...