1002 search results - page 46 / 201 » Towards Graph Programs for Graph Algorithms |
114
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
120
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
116
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
115
click to vote
PPDP
2010
Springer
15 years 11 days ago
2010
Springer
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
122
click to vote
ESOP
2006
Springer
15 years 5 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...