1002 search results - page 185 / 201 » Towards Graph Programs for Graph Algorithms |
128
click to vote
MICRO
1997
IEEE
15 years 4 months ago
1997
IEEE
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
CAE
2007
15 years 2 months ago
2007
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
111
click to vote
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
This paper investigates the application of causal inference methodology for observational studies to software fault localization based on test outcomes and profiles. This methodo...
91
Voted
IPCO
2010
15 years 1 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
UAI
2004
15 years 1 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...