1002 search results - page 68 / 201 » Towards Graph Programs for Graph Algorithms |
163
click to vote
GD
1998
Springer
15 years 6 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
101
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
176
click to vote
ECCV
2008
Springer
16 years 23 days ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
134
click to vote
PLDI
2011
ACM
14 years 5 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in āregularā...
122
click to vote
EUROPAR
2007
Springer
15 years 8 months ago
2007
Springer
The performance of many scientiļ¬c applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...